Fetching the paper…
Reading the bibliography…
In order to solve complex, long-horizon tasks, intelligent robots need to carry out high-level, abstract planning and reasoning in conjunction with motion planning.
E. F. Codd, “Relational completeness of data base sublanguages,” in Database Systems , R. R, Ed., 1972
1972
Earlier work this paper cites.
T. L. Dean and M. S. Boddy, “An analysis of time-dependent planning.” in In Proc. AAAI , 1988
1988
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis, “An analysis of stochastic shortest path problems,” Mathematics of Operations Research , vol. 16, no. 3, pp. 580–595, 1991
1991
Earlier work this paper cites.
S. Zilberstein and S. J. Russell, “Anytime sensing, planning and action: A practical model for robot control,” in Proc. IJCAI , 1993
1993
Earlier work this paper cites.
T. Dean, L. P. Kaelbling, J. Kirman, and A. Nicholson, “Planning under time constraints in stochastic domains,” Artificial Intelligence , vol. 76, no. 1-2, pp. 35–74, 1995
1995
Earlier work this paper cites.
S. P. Singh, T. Jaakkola, and M. I. Jordan, “Reinforcement learning with soft state aggregation,” in In Proc. NIPS , 1995
1995
Earlier work this paper cites.
N. Immerman, Descriptive complexity . Springer Science & Business Media, 1998
1998
Earlier work this paper cites.
E. A. Hansen and S. Zilberstein, “LAO ∗ : A heuristic search algorithm that finds solutions with loops,” Artificial Intelligence , vol. 129, no. 1-2, pp. 35–62, 2001
2001
Earlier work this paper cites.
L. Li, T. J. Walsh, and M. L. Littman, “Towards a unified theory of state abstraction for mdps.” in In Proc. ISAIM , 2006
2006
Earlier work this paper cites.
J. Marecki, Z. Topol, M. Tambe, et al. , “A fast analytical algorithm for mdps with continuous state spaces,” in In Proc. AAMAS , 2006
2006
Earlier work this paper cites.
S. Yoon, A. Fern, and R. Givan, “FF-replan: A baseline for probabilistic planning,” in In Proc. ICAPS , 2007
2007
Earlier work this paper cites.
S. Srivastava, N. Immerman, and S. Zilberstein, “Learning generalized plans using abstract counting,” in In Proc. AAAI , 2008
2008
Earlier work this paper cites.
S. Cambon, R. Alami, and F. Gravot, “A hybrid approach to intricate motion, manipulation and task planning,” IJRR , vol. 28, pp. 104–126, 2009
2009
Earlier work this paper cites.
B. Bonet, H. Palacios, and H. Geffner, “Automatic derivation of memoryless policies and finite-state controllers using classical planners,” in In Proc. ICAPS , 2009
2009
Earlier work this paper cites.
S. Sanner, “Relational dynamic influence diagram language (rddl): Language description,” 2010, http://users.cecs.anu.edu.au/~ssanner/IPPC_2011/RDDL.pdf
2010
Earlier work this paper cites.
R. Diankov, “Automated construction of robotic manipulation programs,” Ph.D. dissertation, Carnegie Mellon University, 2010
2010
Earlier work this paper cites.
E. Plaku and G. D. Hager, “Sampling-based motion and symbolic action planning with geometric and differential constraints,” in In Proc. ICRA , 2010
2010
Cited alongside, same era.
L. P. Kaelbling and T. Lozano-Pérez, “Hierarchical task and motion planning in the now,” in In Proc. ICRA , 2011
2011
Cited alongside, same era.
S. Srivastava, N. Immerman, and S. Zilberstein, “A new representation and associated algorithms for generalized planning,” Artificial Intelligence , vol. 175, no. 2, pp. 615–647, 2011
2011
Cited alongside, same era.
Y. Hu and G. De Giacomo, “Generalized planning: Synthesizing plans that work for multiple environments,” in In Proc. IJCAI , 2011
2011
Cited alongside, same era.
A. Hertle, C. Dornhege, T. Keller, and B. Nebel, “Planning with semantic attachments: An object-oriented view,” in In Proc. ECAI , 2012
2012
R. Chitnis, D. Hadfield-Menell, A. Gupta, S. Srivastava, E. Groschev, C. Lin, and P. Abbeel, “Guided search for task and motion plans using learned heuristics,” in In Proc. ICRA , 2016
2016
Later among the works it cites.
S. Srivastava, S. Russell, and A. Pinto, “Metaphysics of planning domain descriptions,” in In Proc. AAAI , 2016
2016
Later among the works it cites.
M. Wise, M. Ferguson, D. King, E. Diehr, and D. Dymesich, “Fetch and freight: Standard platforms for service robot applications,” in Workshop on Autonomous Mobile Service Robots , 2016
2016
Later among the works it cites.
N. T. Dantam, Z. K. Kingston, S. Chaudhuri, and L. E. Kavraki, “Incremental task and motion planning: A constraint-based approach.” in In Proc. RSS , 2016
2016
Later among the works it cites.
A. Bai, S. Srivastava, and S. J. Russell, “Markovian state and action abstractions for MDPs via hierarchical MCTS.” in In Proc. IJCAI , 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
I. A. Şucan and L. E. Kavraki, “Accounting for uncertainty in simultaneous task and motion planning using task motion multigraphs,” in In Proc. ICRA , 2012
2012
Cited alongside, same era.
L. P. Kaelbling and T. Lozano-Pérez, “Integrated task and motion planning in belief space,” IJRR , vol. 32, no. 9-10, pp. 1194–1227, 2013
2013
Cited alongside, same era.
S. Srivastava, E. Fang, L. Riano, R. Chitnis, S. Russell, and P. Abbeel, “A modular approach to task and motion planning with an extensible planner-independent interface layer,” in In Proc. ICRA , 2014
2014
Cited alongside, same era.
L. Pineda, “MDP-Lib,” https://github.com/luisenp/mdp-lib , 2014
2014
Cited alongside, same era.
J. Hostetler, A. Fern, and T. Dietterich, “State aggregation in monte carlo tree search.” in In Proc. AAAI , 2014
2014
Cited alongside, same era.
M. Cashmore, M. Fox, D. Long, D. Magazzeni, B. Ridder, A. Carrera, N. Palomeras, N. Hurtos, and M. Carreras, “Rosplan: Planning in the robot operating system,” in In Proc. ICAPS , 2015
2015
Cited alongside, same era.
D. Hadfield-Menell, E. Groshev, R. Chitnis, and P. Abbeel, “Modular task and motion planning in belief space,” in In Proc. IROS , 2015
2015
Cited alongside, same era.
2016
Later among the works it cites.
M. Hausknecht and P. Stone, “Deep reinforcement learning in parameterized action space,” in In Proc. ICLR , 2016
2016
Later among the works it cites.
C. R. Garrett, T. Lozano-Pérez, and L. P. Kaelbling, “Ffrob: Leveraging symbolic planning for efficient task and motion planning,” IJRR , vol. 37, no. 1, pp. 104–136, 2018. [Online]. Available: https://doi.org/10.1177/0278364917739114
2018
Later among the works it cites.
N. T. Dantam, Z. K. Kingston, S. Chaudhuri, and L. E. Kavraki, “An incremental constraint-based framework for task and motion planning,” IJRR , vol. 37, no. 10, pp. 1134–1151, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
C. R. Garrett, T. Lozano-Pérez, and L. P. Kaelbling, “Sampling-based methods for factored task and motion planning,” IJRR , vol. 37, no. 13-14, pp. 1796–1825, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
Z. Wang, C. R. Garrett, L. P. Kaelbling, and T. Lozano-Pérez, “Active model learning and diverse action sampling for task and motion planning,” in In Proc. IROS , 2018
2018
Later among the works it cites.
Z. G. Saribatur, P. Schüller, and T. Eiter, “Abstraction for non-ground answer set programs,” in In Proc.JELIA , 2019
2019
Closest in time.
N. Shah, K. Kumar, P. Khamojhalla, D. Kala Vasudevan, and S. Srivastava, “Anytime integrated task and motion policies for stochastic environments,” Arizona State University, School of Computing, Informatics, and Decision System Engineering, Tech. Rep. ASUCISE-2019-001, 2019. [Online]. Available: https://aair-lab.github.io/stamp.html
2019
Closest in time.