Feature #2362

Implement GraphRRT* and compare with other anytime algorithms

Added by Čáp Michal about 6 years ago. Updated over 5 years ago.

Status:ResolvedStart date:06/17/2013
Priority:NormalDue date:
Assignee:Létal Vojtěch% Done:

100%

Category:-Spent time:-
Target version:-

Description

Implement GraphRRT* as described in

M. Čáp, P. Novák, J. Vokřínek, and M. Pěchouček, “Multi-agent RRT*: sampling-based cooperative pathfinding,” in Autonomous Robots and Multirobot Systems Workshop at AAMAS 2013 (to appear), 2013.

and compare it with anytime algorithms such as ARA* and similar. For comparision use:

  • random euclidean graphs
  • large graphs from SuperHub project (Honza Hrncir should be able to assist with this)

History

#1 Updated by Čáp Michal about 6 years ago

M. Čáp, P. Novák, J. Vokřínek, and M. Pěchouček, “Multi-agent RRT*: sampling-based cooperative pathfinding,” in Autonomous Robots and Multirobot Systems Workshop at AAMAS 2013 (to appear), 2013.

Can be downloaded here: http://agents.fel.cvut.cz/~cap/wp-content/papercite-data/pdf/cap_2013_c.pdf

#2 Updated by Létal Vojtěch over 5 years ago

  • % Done changed from 0 to 100

#3 Updated by Létal Vojtěch over 5 years ago

  • Status changed from New to Resolved

Also available in: Atom PDF