Abstract
Planning in real-world environments can be challenging for intelligent robots due to incomplete domain knowledge that results from unpredictable domain dynamism, and due to lack of global observability. Action language \(\mathcal{BC}\) can be used for planning by formalizing the preconditions and (direct and indirect) effects of actions, and is especially suited for planning in robotic domains by incorporating defaults with the incomplete domain knowledge. However, planning with \(\mathcal{BC}\) is very computationally expensive, especially when action costs are considered. We introduce algorithm PlanHG for formalizing \(\mathcal{BC}\) domains at different abstraction levels in order to trade optimality for significant efficiency improvement when aiming to minimize overall plan cost. We observe orders of magnitude improvement in efficiency compared to a standard “flat” planning approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
As a preprocessing step, computing \(\mathcal{L}\) does not affect the runtime efficiency, so we leave the discussion of its complexity to future work.
- 2.
References
Chen, X., Jin, G., Yang, F.: Extending C+ with composite actions for robotic task planning. In: ICLP (Technical Communications), pp. 404–414 (2012)
Dix, J., Kuter, U., Nau, D.S.: Planning in answer set programming using ordered task decomposition. In: Günter, A., Kruse, R., Neumann, B. (eds.) KI 2003. LNCS (LNAI), vol. 2821, pp. 490–504. Springer, Heidelberg (2003)
Erol, K., Hendler, J.A., Nau, D.S.: HTN planning: complexity and expressivity. In: National Conference on Artificial Intelligence (AAAI) (1994)
Fikes, R.E., Nilsson, N.J.: Strips: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3), 189–208 (1972)
Fox, D., Burgard, W., Dellaert, F., Thrun, S.: Monte carlo localization: efficient position estimation for mobile robots. In: National Conference on Artificial Intelligence (AAAI) (1999)
Galindo, C., Fernandez-Madrigal, J.A., Gonzalez, J.: Improving efficiency in mobile robot task planning through world abstraction. IEEE Trans. Robot. 20(4), 677–690 (2004)
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo= asp+ control: preliminary report. In: arXiv preprint (2014) arXiv:1405.3694
Cabalar, P.: Answer set; programming? In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol. 6565, pp. 334–343. Springer, Heidelberg (2011)
Gelfond, M., Lifschitz, V.: Action languages. Electron. Trans. Artif. Intell. (ETAI) 3, 193–210 (1998)
Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artif. Intell. (AIJ) 153(1–2), 49–104 (2004)
Helmert, M.: The fast downward planning system. J. Artif. Intell. Res. 26, 191–246 (2006)
Kaelbling, L.P., Lozano-Pérez, T.: Hierarchical task and motion planning in the now. In: IEEE International Conference on Robotics and Automation (ICRA). IEEE (2011)
Khandelwal, P., Yang, F., Leonetti, M., Lifschitz, V., Stone, P.: Planning in action language \({\cal BC}\) while learning action costs for mobile robots. In: International Conference on Automated Planning and Scheduling (ICAPS) (2014)
Lee, J., Lifschitz, V., Yang, F.: Action Language \({\cal BC}\): a preliminary report. In: International Joint Conference on Artificial Intelligence (IJCAI) (2013)
Lifschitz, V.: Answer set programming and plan generation. Artif. Intell. 138, 39–54 (2002)
Marthi, B., Russell, S., Wolfe, J.: Angelic hierarchical planning: optimal and online algorithms (revised). Technical Report, UCB/EECS-2009-122, EECS Department, University of California, Berkeley (2009)
McDermott, D., Ghallab, M., Howe, A., Knoblock, C., Ram, A., Veloso, M., Weld, D., Wilkins, D.: PDDL-the planning domain definition language (1998)
McIlraith, S.A., Fadel, R.: Planning with complex actions. In: International Workshop on Non-Monotonic Reasoning (NMR) (2002)
Nebel, B.: The FF planning system: fast plan generation through heuristic search. J. Artif. Intell. Res. 14, 253–302 (2001)
Pednault, E.: ADL: exploring the middle ground between STRIPS and the situation calculus. In: International Conference on Principles of Knowledge Representation and Reasoning (KR) (1989)
Quigley, M., Conley, K., Gerkey, B., Faust, J., Foote, T., Leibs, J., Wheeler, R., Ng, A.Y.: ROS: an open-source robot operating system. In: Open Source Software in Robotics Workshop (2009)
Rosenthal, S., Veloso, M.M.: Mobile robot planning to seek help with spatially-situated tasks. In: AAAI (2012)
Sacerdoti, E.D.: Planning in a hierarchy of abstraction spaces. Artif. Intell. 5(2), 115–135 (1974)
Tenenberg, J.D.: Abstraction in planning. Ph.D. thesis, University of Rochester (1988)
Thiébaux, S., Hoffmann, J., Nebel, B.: In defense of PDDL axioms. In: International Joint Conference on Artificial Intelligence (IJCAI) (2003)
Zhang, S., Sridharan, M., Gelfond, M., Wyatt, J.: Towards an architecture for knowledge representation and reasoning in robotics. In: Beetz, M., Johnston, B., Williams, M.-A. (eds.) ICSR 2014. LNCS, vol. 8755, pp. 400–410. Springer, Heidelberg (2014)
Acknowledgments
This work has taken place in the Learning Agents Research Group (LARG) at the Artificial Intelligence Laboratory, The University of Texas at Austin. LARG research is supported in part by grants from the National Science Foundation (CNS-1330072, CNS-1305287), ONR (21C184-01), AFOSR (FA8750-14-1-0070, FA9550-14-1-0087), and Yujin Robot.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhang, S., Yang, F., Khandelwal, P., Stone, P. (2015). Mobile Robot Planning Using Action Language \({\mathcal {BC}}\) with an Abstraction Hierarchy. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-23264-5_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23263-8
Online ISBN: 978-3-319-23264-5
eBook Packages: Computer ScienceComputer Science (R0)