Fetching the paper…
Reading the bibliography…
This paper presents a general-purpose formulation of a large class of discrete-time planning problems, with hybrid state and control-spaces, as factored transition systems.
In: AAAI Conference on Artificial Intelligence . AAAI Press, pp. 1930–1936
Toussaint M (2015) Logic-geometric programming: an optimization-based approach to combined task and motion planning · 1936
Earlier work this paper cites.
Artificial Intelligence 2: 189–208
Fikes RE and Nilsson NJ (1971) STRIPS: A new approach to the application of theorem proving to problem solving · 1971
Earlier work this paper cites.
IEEE Transactions on Systems, Man, and Cybernetics 11: 681–698
Lozano-Pérez T (1981) Automatic planning of manipulator transfer movements · 1981
Earlier work this paper cites.
In: IEEE International Conference on Robotics and Automation (ICRA)
Lozano-Pérez T, Jones JL, Mazer E, O’Donnell PA, Grimson WEL, Tournassoud P and Lanusse A (1987) Handey: A robot system that recognizes, plans, and manipulates · 1987
Earlier work this paper cites.
In: Symposium on Computational Geometry . pp. 279–288
Wilfong GT (1988) Motion planning in the presence of movable obstacles · 1988
Earlier work this paper cites.
In: International Symposium of Robotic Research (ISRR)
Alami R, Siméon T and Laumond JP (1990) A geometrical approach to planning manipulation tasks. the case of discrete placements and grasps · 1990
Earlier work this paper cites.
Technical report, Information and Computer Science, University of California, Irvine
Dechter R (1992) Constraint networks · 1992
Earlier work this paper cites.
In: Workshop on Algorithmic Foundations of Robotics (WAFR)
Alami R, Laumond JP and Siméon T (1994) Two manipulation planning algorithms · 1994
Earlier work this paper cites.
In: AAAI , volume 94. pp. 1123–1128
Erol K, Hendler J and Nau DS (1994) Htn planning: Complexity and expressivity · 1994
Earlier work this paper cites.
Theoretical computer science 138(1): 3–34
Alur R, Courcoubetis C, Halbwachs N, Henzinger TA, Ho PH, Nicollin X, Olivero A, Sifakis J and Yovine S (1995) The algorithmic analysis of hybrid systems · 1995
Earlier work this paper cites.
Computational Intelligence 11(4): 625–655
Bäckström C and Nebel B (1995) Complexity results for SAS+ planning · 1995
Earlier work this paper cites.
In: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing . ACM, pp. 353–362
Kavraki LE, Latombe JC, Motwani R and Raghavan P (1995) Randomized query processing in robot path planning · 1995
Earlier work this paper cites.
UCL press London
Jensen FV (1996) An introduction to Bayesian networks , volume 210 · 1996
Earlier work this paper cites.
IEEE Transactions on Robotics and Automation 12(4): 566–580
Kavraki LE, Svestka P, Latombe JC and Overmars MH (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces · 1996
Earlier work this paper cites.
International Journal of Robotics Research (IJRR) 16(6): 759–774
Barraquand J, Kavraki L, Latombe JC, Motwani R, Li TY and Raghavan P (1997) A random sampling scheme for path planning · 1997
Earlier work this paper cites.
In: Robotics and Automation, 1997. Proceedings., 1997 IEEE International Conference on , volume 3. IEEE, pp. 2719–2726
Hsu D, Latombe JC and Motwani R (1997) Path planning in expansive configuration spaces · 1997
Earlier work this paper cites.
Robotics and Automation, IEEE Transactions on 14(1): 166–171
Kavraki LE, Kolountzakis MN and Latombe JC (1998) Analysis of probabilistic roadmaps for path planning · 1998
Earlier work this paper cites.
Practical Motion Planning in Robotics: Current Approaches and Future Directions
Kavraki LE and Latombe JC (1998) Probabilistic roadmaps for robot path planning · 1998
Earlier work this paper cites.
Secaucus, NJ, USA: Springer-Verlag New York, Inc
Laumond JPP (1998) Robot Motion Planning and Control · 1998
Earlier work this paper cites.
Technical report, Yale Center for Computational Vision and Control
McDermott D, Ghallab M, Howe A, Knoblock C, Ram A, Veloso M, Weld D and Wilkins D (1998) Pddl: The planning domain definition language · 1998
Earlier work this paper cites.
Proceedings of the IEEE 88(7): 971–984
Alur R, Henzinger TA, Lafferriere G and Pappas GJ (2000) Discrete abstractions of hybrid systems · 2000
Earlier work this paper cites.
In: IEEE International Conference on Robotics and Automation (ICRA) , volume 1. IEEE, pp. 521–528
Bohlin R and Kavraki LE (2000) Path planning using lazy PRM · 2000
Earlier work this paper cites.
In: Verification of Digital and Hybrid Systems . Springer, pp. 265–292
Henzinger TA (2000) The theory of hybrid automata · 2000
Earlier work this paper cites.
In: IEEE International Conference on Robotics and Automation (ICRA)
Kuffner JJ Jr and LaValle SM (2000) RRT-Connect: An efficient approach to single-query path planning · 2000
Cited alongside, same era.
Artificial Intelligence 129(1): 5–33
Bonet B and Geffner H (2001) Planning as heuristic search · 2001
Cited alongside, same era.
Journal Artificial Intelligence Research (JAIR) 14: 253–302
Hoffmann J and Nebel B (2001) The FF planning system: Fast plan generation through heuristic search · 2001
Cited alongside, same era.
In: Proc. 40th IEEE Conf. on Decision and Control , volume 3. IEEE, pp. 2899–2904
Torrisi FD and Bemporad A (2001) Discrete-time hybrid modeling and verification · 2001
Cited alongside, same era.
4th International Planning Competition (IPC’04), at ICAPS’04. URL https://pdfs.semanticscholar.org/4b3c/0706d2673d817cc7c33e580858e65b134ba2.pdf
Edelkamp S (2004) Pddl2.2: The language for the classical part of the 4th international planning competition · 2004
Cited alongside, same era.
International Journal of Robotics Research (IJRR) 30(6): 676–698
Hauser K and Ng-Thow-Hing V (2011) Randomized multi-modal motion planning for a humanoid robot manipulation task · 2011
Later among the works it cites.
In: IEEE International Conference on Robotics and Automation (ICRA)
Kaelbling LP and Lozano-Pérez T (2011) Hierarchical planning in the now · 2011
Later among the works it cites.
The International Journal of Robotics Research 30(7): 846–894
Karaman S and Frazzoli E (2011) Sampling-based algorithms for optimal motion planning · 2011
Later among the works it cites.
In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Lagriffoul F, Dimitrov D, Saffiotti A and Karlsson L (2012) Constraint propagation on interval bounds for dealing with geometric backtracking · 2012
Later among the works it cites.
In: RAS/EMBS International Conference on Biomedical Robotics and Biomechatronics
Pandey AK, Saut JP, Sidobre D and Alami R (2012) Towards planning human-robot interactive manipulation tasks: Task dependent and human oriented autonomous selection of grasp and placement · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
International Journal of Robotics Research (IJRR) 23(7-8): 729–746
Siméon T, Laumond JP, Cortés J and Sahbani A (2004) Manipulation planning with probabilistic roadmaps · 2004
Cited alongside, same era.
Smith R (2005) Open dynamics engine
2005
Cited alongside, same era.
Artificial Intelligence 168(1-2): 38–69
Thiébaux S, Hoffmann J and Nebel B (2005) In defense of pddl axioms · 2005
Cited alongside, same era.
Journal of Artificial Intelligence Research (JAIR) 26: 191–246
Helmert M (2006) The fast downward planning system · 2006
Cited alongside, same era.
Cambridge University Press
LaValle SM (2006) Planning Algorithms · 2006
Cited alongside, same era.
In: Workshop on Algorithmic Foundations of Robotics (WAFR)
Stilman M and Kuffner JJ (2006) Planning among movable obstacles with artificial constraints · 2006
Cited alongside, same era.
In: IEEE International Conference on Robotics and Automation (ICRA)
Stilman M, Schamburek JU, Kuffner JJ and Asfour T (2007) Manipulation planning among movable obstacles · 2007
Cited alongside, same era.
In: Robotics and Automation (ICRA), 2013 IEEE International Conference on . IEEE, pp. 1799–1806
Barry J, Kaelbling LP and Lozano-Pérez T (2013) A hierarchical approach to manipulation with diverse actions · 2013
Later among the works it cites.
PhD Thesis, Massachusetts Institute of Technology
Barry JL (2013) Manipulation with diverse actions · 2013
Later among the works it cites.
In: RSS Workshop on Combined Robot Motion Planning and AI Planning for Practical Applications
de Silva L, Pandey AK, Gharbi M and Alami R (2013) Towards combining HTN planning and geometric task planning · 2013
Later among the works it cites.
In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) Workshop on AI-based robotics
Dornhege C, Hertle A and Nebel B (2013) Lazy evaluation and subsumption caching for search-based integrated task and motion planning · 2013
Later among the works it cites.
In: Workshop on the Algorithmic Foundations of Robotics (WAFR)
Garrett CR, Lozano-Pérez T and Kaelbling LP (2014) FFRob: An efficient heuristic for task and motion planning · 2014
Later among the works it cites.
International Journal of Robotics Research (IJRR) : 0278364914545811URL http://journals.sagepub.com/doi/abs/10.1177/0278364914545811?journalCode=ijra
Lagriffoul F, Dimitrov D, Bidot J, Saffiotti A and Karlsson L (2014) Efficiently combining task and motion planning using geometric constraints · 2014
Later among the works it cites.
In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, pp. 3684–3691
Lozano-Pérez T and Kaelbling LP (2014) A constraint-based method for solving sequential manipulation planning problems · 2014
Later among the works it cites.
In: IEEE International Conference on Robotics and Automation (ICRA)
Srivastava S, Fang E, Riano L, Chitnis R, Russell S and Abbeel P (2014) Combined task and motion planning through an extensible planner-independent interface layer · 2014
Later among the works it cites.
In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Garrett CR, Lozano-Pérez T and Kaelbling LP (2015) Backward-forward search for manipulation planning · 2015
Later among the works it cites.
In: Robotics: Science and Systems (RSS) . Rome, Italy
Krontiris A and Bekris KE (2015) Dealing with difficult instances of object rearrangement · 2015
Later among the works it cites.
In: Algorithmic Foundations of Robotics XI . Springer, pp. 641–657
Vendittelli M, Laumond JP and Mishra B (2015) Decidability of robot manipulation planning: Three disks in the plane · 2015
Later among the works it cites.
In: Robotics: Science and Systems (RSS)
Dantam NT, Kingston Z, Chaudhuri S and Kavraki LE (2016) Incremental task and motion planning: A constraint-based approach · 2016
Later among the works it cites.
Dellin CM and Srinivasa SS (2016) A unifying formalism for shortest path problems with expensive edge evaluations via lazy best-first search over paths with edge selectors · 2016
Later among the works it cites.
Workshop on Algorithmic Foundations of Robotics (WAFR) URL http://lis.csail.mit.edu/pubs/deshpande-WAFR16.pdf
Deshpande A, Kaelbling LP and Lozano-P?erez T (2016) Decidability of semi-holonomic prehensile task and motion planning · 2016
Later among the works it cites.
In: International Conference on Robotics and Automation (ICRA) . Stockholm, Sweden
Krontiris A and Bekris KE (2016) Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner · 2016
Later among the works it cites.
In: Workshop on the Algorithmic Foundations of Robotics (WAFR)
Vega-Brown W and Roy N (2016) Asymptotically optimal planning under piecewise-analytic constraints · 2016
Later among the works it cites.
In: Robotics and Automation (ICRA), 2017 IEEE International Conference on . IEEE, pp. 4044–4051
Toussaint M and Lopes M (2017) Multi-bound tree search for logic-geometric programming in cooperative manipulation domains · 2017
Later among the works it cites.