-
Notifications
You must be signed in to change notification settings - Fork 67
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Question about FAR algorithm to handle the path finding issue in the referenced paper #15
Comments
Hey! Always happy if it is helpful. FAR should not be able to handle the situation without additional deadlock handling. Unfortunately, it became a little rough to test just the path planning algorithms without everything else in the simulation going on. However, with some clever design you should be able to edit a .xinst file with a layout to test your questions. It's tedious though without the missing editor. There are some ways by holding down ctrl and drawing rectangles in the UI to remove waypoints, etc. and do fine tuning in the XML though (admittedly not a great experience). |
Got it, thanks for your explaination, I will give it a try. |
Yeah, like I mentioned the implementation / this version of FAR is quite limited in what it can cope with. The layout itself needs to have some characteristics to reduce these effects (the default layout has that to some extent). I need to dig into the code again to give more detailed pointers. Can you provide the code and input files you used? |
Hi, thanks for you feedback, you can use the code forked from your repository: https://github.com/Phymin/RAWSim-O.git, and checkout the commit of : 82da3c6 For the layout I don't change much, you can cofigure it according to the following picture: Thanks for your time. |
Sorry for dropping the ball on this. I am still planning to look into this more deeply, but can't find the time right now. 😬 |
Ok, take your time. |
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:
![image](https://private-user-images.githubusercontent.com/9857420/307816797-858cc081-40dc-440b-8ef5-7d36703df3e0.png?jwt=eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJnaXRodWIuY29tIiwiYXVkIjoicmF3LmdpdGh1YnVzZXJjb250ZW50LmNvbSIsImtleSI6ImtleTUiLCJleHAiOjE3Mzg5MDA1MjYsIm5iZiI6MTczODkwMDIyNiwicGF0aCI6Ii85ODU3NDIwLzMwNzgxNjc5Ny04NThjYzA4MS00MGRjLTQ0MGItOGVmNS03ZDM2NzAzZGYzZTAucG5nP1gtQW16LUFsZ29yaXRobT1BV1M0LUhNQUMtU0hBMjU2JlgtQW16LUNyZWRlbnRpYWw9QUtJQVZDT0RZTFNBNTNQUUs0WkElMkYyMDI1MDIwNyUyRnVzLWVhc3QtMSUyRnMzJTJGYXdzNF9yZXF1ZXN0JlgtQW16LURhdGU9MjAyNTAyMDdUMDM1MDI2WiZYLUFtei1FeHBpcmVzPTMwMCZYLUFtei1TaWduYXR1cmU9ZDNmNDUzNzI4YzQ0ZTlmZGY3Njc5OGYyY2U1YTA2NGNhNzgyY2MyZWUwMzI1YTdhNTg4OTQ2YzZkZjk3NWM1MiZYLUFtei1TaWduZWRIZWFkZXJzPWhvc3QifQ.4ZlOfV9MoIuDKvkIXY8qfONlzZdy9_0FhVbQnEiKlVU)
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
The text was updated successfully, but these errors were encountered: