Skip to content

Question about FAR algorithm to handle the path finding issue in the referenced paper #15

@Phymin

Description

@Phymin

Hi,

First I'd like to say this project is amazing, it's completed and with good design, the source code is easy to follow even I am not familiar with C# language. After I read the referenced paper, I have a small question to ask:
From the paper, the WHCA* algorithm can handle the following issue (see the picture below) by itself. So can the FAR algorithm handle this issue without evade strategy? Or it should handle the issue with evade strategy and deadlock handler? Because I'm not familiar with C# and I don't find a way to test this with the GUI simulator, could you provide some explaination here? Thanks
image

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions