Computational Tradeoffs of Search Methods for Minimum Constraint Removal Paths

Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015

Volumn 2015-January, Issue , 2015, Pages 181-185

  Krontiris, Athanasios ^a   Bekris, Kostas E ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; MOTION PLANNING;

APPROXIMATE METHODS; COMPUTATIONAL COSTS; OPTIMUM SOLUTION; PATH LENGTH; SEARCH METHOD;

DYNAMIC PROGRAMMING;

EID: 84962304693     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Botea, A.; Muller, M.; and Schaffer, J. 2002. Using Abstraction for Planning in Sokoban. Computers and Games 360–375.
2. Cohen, J. B.; Chitta, S.; and Likhachev, M. 2014. Single- and dual-arm motion planning with heuristic search. International Journal of Robotic Research 33(2):305–320.
3. Dogar, M., and Srinivasa, S. 2011. A Push-Grasping Framework in Clutter. In RSS.
4. Erickson, L. H., and LaValle, S. M. 2013. A Simple, but NP-Hard Motion Planning Problem. In AAAI Conference on Artificial Intelligence.
5. Gobelbecker, M.; Keller, T.; Eyerich, P.; Brenner, M.; and Nebel, B. 2010. Coming up with good excuses: What to do when no plan can be found. In International Conference on Automated Planning and Scheduling.
6. Hauser, K. 2013a. Minimum Constraint Displacement Motion Planning. In RSS.
7. Hauser, K. 2013b. The minimum constraint removal problem with three robotics applications. The International Journal of Robotics Research 0278364913507795.
8. Hearn, R., and Demaine, E. 2005. P-Space Completeness of Sliding-block Puzzles and other Problems through the Non-Deterministic Constraint Logic Model of Computation. Theoretical Computer Science 343(1):72–96.
9. Kavraki, L. E.; Svestka, P.; Latombe, J.-C.; and Overmars, M. 1996. Probabilistic Roadmaps for Path Planning in High-Dim. Configuration Spaces. IEEE TRA.
10. Krontiris, A., and Bekris, K. E. 2015.”dealing with difficult instances of object rearrangement”. In Robotics: Science and Systems (RSS).
11. Krontiris, A.; Shome, R.; Dobson, A.; Kimmel, A.; and Bekris, K. E. 2014. Rearranging similar objects with a manipulator using pebble graphs. In IEEE-RAS International Conference on Humanoid Robots (HUMANOIDS).
12. Krontiris, A.; Luna, R.; and Bekris, K. E. 2013. From Feasibility tests to Path Planners for Multi-agent Pathfinding. In Sixth Annual Symposium on Combinatorial Search (SoCS).
13. LaValle, S. M., and Kuffner, J. J. 2001. Randomized Kino-dynamic Planning. IJRR.
14. Luna, R., and Bekris, K. E. 2011. Efficient and Complete Centralized Multi-Robot Path Planning. In IEEE-RAS International Conference on Intelligent Robots and Systems (IROS).
15. McCarthy, Z.; Bretl, T.; and Hutchinson, S. 2012. Proving Path Non-Existence using Sampling and Alpha Shapes. In IEEE International Conference on Robotics and Automation (ICRA), 2563–2569.
16. Pereira, A. G.; Ritt, M. R. P.; and Buriol, L. S. 2013. Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases. In Symposium on Combinatorial Search (SoCS).
17. Sharon, G.; Stern, R.; Felner, A.; and Sturtevant, N. 2015. The Conflict-based Search Algorithm for Multi-Agent Pathfinding. Artificial Intelligence Journal (AIJ) 40–66.
18. Stilman, M., and Kuffner, J. 2004. Navigation among Movable Obstacles: Realtime Reasoning in Complex Environments. In Humanoid Robotics, 322–341.
19. Stilman, M., and Kuffner, J. J. 2006. Planning Among Movable Obstacles with Artificial Constraints. In WAFR.
20. Wilfong, G. 1988. Motion Planning in the Presence of Movable Obstacles. In Annual Symp. of Computational Geometry, 279–288.
21. Zhang, L.; Kim, Y.; and Manocha, D. 2008. A Simple Path Non-Existence Algorithm using C-Obstacle Query. In Workshop on the Algorithmic Foundations of Robotics (WAFR).