-
-
Notifications
You must be signed in to change notification settings - Fork 7.1k
feat: Conflict Based Search #1335
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
Open
SchwartzCode
wants to merge
29
commits into
AtsushiSakai:master
Choose a base branch
from
SchwartzCode:jbs/conflict_based_search
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
feat: Conflict Based Search #1335
SchwartzCode
wants to merge
29
commits into
AtsushiSakai:master
from
SchwartzCode:jbs/conflict_based_search
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…better constraint finding
fffc61c to
3ffd2ff
Compare
SchwartzCode
commented
Dec 29, 2025
|
|
||
| This algorithm can also solve some cases that a priority based planner cannot, such as the below example where one robot must move out of the way of another robot's path. Without cooperation across agent paths, this case cannot be solved. | ||
|
|
||
| TODO: image waiting on this PR: https://github.com/AtsushiSakai/PythonRoboticsGifs/pull/14 |
Contributor
Author
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Will update when this PR merges: AtsushiSakai/PythonRoboticsGifs#14
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Reference issue
What does this implement/fix?
This pull request implements Conflict Based Search as outlined in this paper: https://cdn.aaai.org/ojs/8140/8140-13-11667-1-2-20201228.pdf
This is a MAPF algorithm (multi-agent path finding) that breaks the search into two levels. The upper level searches for a series of constraints on the agents that leads to a valid solution, and the lower level search finds paths for single agents given the constraints provided by the upper level search. The pseudo-code in the paper is a good reference for understanding the algorithm itself:
Additional information
PR into PythonRoboticsGifs here: AtsushiSakai/PythonRoboticsGifs#14
CheckList