Task planning in robotics: an empirical comparison of PDDL- and ASP-based systems

Yu-qian JIANG; Shi-qi ZHANG; Piyush KHANDELWAL; Peter STONE

doi:10.1631/FITEE.1800514

Your Location：

Home >

Browse articles >

Task planning in robotics: an empirical comparison of PDDL- and ASP-based systems

Special Feature on Intelligent Robots | Updated：2022-05-19

- Task planning in robotics: an empirical comparison of PDDL- and ASP-based systems
  Enhanced Publication
- 机器人任务规划：基于PDDL和ASP的任务规划系统实验比较研究
- Frontiers of Information Technology & Electronic Engineering Vol. 20, Issue 3, Pages: 363-373(2019)
- Affiliations：
  
  Department of Computer Science, The University of Texas at Austin, TX 78712, USA
  Department of Computer Science, The State University of New York at Binghamton, NY 13902, USA
  Cogitai, Inc., TX 78756, USA
- Author bio：
  
  [ "Yu-qian JIANG, E-mail: jiangyuqian@utexas.edu" ]
  Shi-qi ZHANG, E-mail: szhang@cs.binghamton.edu
  [ "Piyush KHANDELWAL, E-mail: piyushk@gmail.com" ]
  [ "Peter STONE, E-mail: pstone@cs.utexas.edu" ]
- Funds：
- DOI：10.1631/FITEE.1800514
  CLC： TP242
- Published：2019-03，
  
  Received：29 August 2018，
  
  Revised：14 March 2019，
- Accepted：
Scan QR Code
YU-QIAN JIANG, SHI-QI ZHANG, PIYUSH KHANDELWAL, et al. Task planning in robotics: an empirical comparison of PDDL- and ASP-based systems. [J]. Frontiers of information technology & electronic engineering, 2019, 20(3): 363-373.
DOI：

YU-QIAN JIANG, SHI-QI ZHANG, PIYUSH KHANDELWAL, et al. Task planning in robotics: an empirical comparison of PDDL- and ASP-based systems. [J]. Frontiers of information technology & electronic engineering, 2019, 20(3): 363-373. DOI： 10.1631/FITEE.1800514.

摘要

面对无法用单一动作解决的复杂任务时，机器人需要通过任务规划算法生成一个动作序列。现有任务规划器可以帮助智能机器人开发人员解决许多种类任务规划问题。然而，不同规划器有不同优势和劣势，没有统一准则针对问题选择规划器。本文比较了目前最先进的基于规划领域定义语言（planning domain description language

PDDL）和回答集程序（answer set programming

ASP）规划器的性能。PDDL是特别为任务规划而设计的动作语言，被广泛应用于各种规划问题。ASP主要用于知识推理，同时也能解决任务规划问题。针对这两种语言，本文使用尽可能相同的领域描述。实验结果表明，基于PDDL的规划器善于解决需要生成较多待执行动作的问题，而基于ASP的规划器更适合解决涉及对象较多的任务，或需对前提条件和后置条件做复杂推理的规划问题。针对具体机器人规划问题，本文得到的结论可以帮助研究人员从通用规划系统中选择合适规划器。

Abstract

Robots need task planning algorithms to sequence actions toward accomplishing goals that are impossible through individual actions. Off-the-shelf task planners can be used by intelligent robotics practitioners to solve a variety of planning problems. However

many different planners exist

each with different strengths and weaknesses

and there are no general rules for which planner would be best to apply to a given problem. In this study

we empirically compare the performance of state-of-the-art planners that use either the planning domain description language (PDDL) or answer set programming (ASP) as the underlying action language. PDDL is designed for task planning

and PDDL-based planners are widely used for a variety of planning problems. ASP is designed for knowledge-intensive reasoning

but can also be used to solve task planning problems. Given domain encodings that are as similar as possible

we find that PDDL-based planners perform better on problems with longer solutions

and ASP-based planners are better on tasks with a large number of objects or tasks in which complex reasoning is required to reason about action preconditions and effects. The resulting analysis can inform selection among general-purpose planning systems for particular robot task planning domains.

关键词

任务规划机器人规划领域定义语言（PDDL）回答集程序（ASP）

Keywords

Task planningRoboticsPlanning domain description language (PDDL)Answer set programming (ASP)

references

J Babb, , , J Lee. . Action language BC+: preliminary report. . Proc 29th AAAI Conf on Artificial Intelligence, , 2015. . p.1424--1430. . ..

F Calimeri, , , M Gebser, , , M Maratea, , , 等. . Design and results of the fifth answer set programming competition. . Artif Intell, , 2016. . 231151--181. . DOI:10.1016/j.artint.2015.09.008http://doi.org/10.1016/j.artint.2015.09.008..

S Cambon, , , R Alami, , , F Gravot. . A hybrid approach to intricate motion, manipulation and task planning. . Int J Robot Res, , 2009. . 28((1):):104--126. . DOI:10.1177/0278364908097884http://doi.org/10.1177/0278364908097884..

XP Chen, , , JM Ji, , , JQ Jiang, , , 等. . Developing highlevel cognitive functions for service robots. . Proc 9th Int Conf on Autonomous Agents and Multiagent Systems, , 2010. . p.989--996. . ..

A Coles, , , A Coles, , , AG Olaya, , , 等. . A survey of the seventh international planning competition. . AI Mag, , 2012. . 33((1):):83--88. . DOI:10.1609/aimag.v33i1.2392http://doi.org/10.1609/aimag.v33i1.2392..

T de la Rosa, , , AG Olaya, , , D Borrajo. . Using cases utility for heuristic planning improvement. . Int Conf on Case-Based Reasoning, , 2007. . p.137--148. . DOI:10.1007/978-3-540-74141-1_10http://doi.org/10.1007/978-3-540-74141-1_10..

E Erdem, , , V Patoglu. . Applications of ASP in robotics. . KI-Künstl Intell, , 2018. . 32((2-3):):143--149. . DOI:10.1007/s13218-018-0544-xhttp://doi.org/10.1007/s13218-018-0544-xDOI:10.1007/s13218-018-0544-xhttp://doi.org/10.1007/s13218-018-0544-x..

E Erdem, , , E Aker, , , V Patoglu. . Answer set programming for collaborative housekeeping robotics: representation, reasoning, and execution. . Intell Ser Robot, , 2012. . 5((4):):275--291. . DOI:10.1007/s11370-012-0119-xhttp://doi.org/10.1007/s11370-012-0119-x..

E Erdem, , , M Gelfond, , , N Leone. . Applications of answer set programming. . AI Mag, , 2016. . 37((3):):53--58. . DOI:10.1609/aimag.v37i3.2678http://doi.org/10.1609/aimag.v37i3.2678..

C Fawcett, , , M Vallati, , , F Hutter, , , 等. . Improved features for runtime prediction of domain-independent planners. . Proc 24th Int Conf on Automated Planning and Scheduling, , 2014. . p.355--359. . ..

RE Fikes, , , NJ Nilsson. . Strips: a new approach to the application of theorem proving to problem solving. . Artif Intell, , 1971. . 2((3-4):):189--208. . DOI:10.1016/0004-3702(71)90010-5http://doi.org/10.1016/0004-3702(71)90010-5..

M Gebser, , , T Grote, , , T Schaub. . Coala: a compiler from action languages to ASP. . European Workshop on Logics in Artificial Intelligence, , 2010. . p.360--364. . DOI:10.1007/978-3-642-15675-5_32http://doi.org/10.1007/978-3-642-15675-5_32..

M Gebser, , , R Kaminski, , , M Knecht, , , 等. . plasp: a prototype for PDDL-based planning in ASP. . In: Delgrande JP, Faber W (Eds.), Logic Programming and Nonmonotonic Reasoning. Springer, Berlin, , 2011. . p.358--363. . DOI:10.1007/978-3-642-20895-9_41http://doi.org/10.1007/978-3-642-20895-9_41..

M Gebser, , , R Kaminski, , , B Kaufmann, , , 等. . Clingo=ASP+control: preliminary report, , 2014. . 1405--3694. . http://arxiv.org/abs/1405.3694http://arxiv.org/abs/1405.3694, , ..

M Gelfond, , , Y Kahl. . Knowledge Representation, Reasoning, and the Design of Intelligent Agents the AnswerSet Programming Approach. . Cambridge University Press, Cambridge, , 2014. ..

M Gelfond, , , V Lifschitz. . Action languages. . Electron Trans Artif Intell, , 1998. . 3((6):):195--210. . ..

E Giunchiglia, , , J Lee, , , V Lifschitz, , , 等. . Nonmonotonic causal theories. . Artif Intell, , 2004. . 153((1-2):):49--104. . DOI:10.1016/j.artint.2002.12.001http://doi.org/10.1016/j.artint.2002.12.001..

M Helmert. . The fast downward planning system. . J Artif Intell Res, , 2006. . 26191--246. . DOI:10.1613/jair.1705http://doi.org/10.1613/jair.1705..

M Helmert, , , G Röger, , , E Karpas. . Fast downward stone soup: a baseline for building planner portfolios. . Int Conf on Automated Planning and Scheduling Workshop on Planning and Learning, , 2011. . p.28--35. . ..

J Hoffmann. . FF: the fast-forward planning system. . AI Mag, , 2001. . 22((3):):57--62. . ..

P Khandelwal, , , SQ Zhang, , , J Sinapov, , , 等. . BWIBots: a platform for bridging the gap between AI and human– robot interaction research. . Int J Robot Res, , 2017. . 36((5-7):):635--659. . DOI:10.1177/0278364916688949http://doi.org/10.1177/0278364916688949..

J Lee, , , V Lifschitz, , , F Yang. . Action language BC: preliminary report. . Proc 23rd Int Joint Conf on Artificial Intelligence, , 2013. . p.983--989. . ..

K Leyton-Brown, , , E Nudelman, , , Y Shoham. . Learning the empirical hardness of optimization problems: the case of combinatorial auctions. . Int Conf on Principles and Practice of Constraint Programming, , 2002. . p.556--572. . DOI:10.1007/3-540-46135-3_37http://doi.org/10.1007/3-540-46135-3_37..

V Lifschitz. . Two components of an action language. . Ann Math Artif Intell, , 1997. . 21((2-4):):305--320. . ..

V Lifschitz. . Answer set programming and plan generation. . Artif Intell, , 2002. . 138((1-2):):39--54. . DOI:10.1016/S0004-3702(02)00186-8http://doi.org/10.1016/S0004-3702(02)00186-8..

V Lifschitz. . What is answer set programming. . Proc 23rd National Conf on Artificial Intelligence, , 2008. . p.1594--1597. . ..

SY Lo, , , S Zhang, , , P Stone. . PETLON: planning efficiently for task-level-optimal navigation. . Proc 17th Conf on Autonomous Agents and Multiagent Systems, , 2018. . p.220--228. . ..

D McDermott. . The formal semantics of processes in PDDL. . Proc ICAPS Workshop on PDDL, , 2003. . p.101--155. . ..

D McDermott, , , M Ghallab, , , A Howe, , , 等. . PDDL——the planning domain definition language, , 1998. . http://www.cs.yale.edu/homes/dvm/http://www.cs.yale.edu/homes/dvm/, , ..

S Miura, , , A Fukunaga. . Automatic extraction of axioms for planning. . Proc 27th Int Conf on Automated Planning and Scheduling, , 2017. . p.218--227. . ..

S Richter, , , M Westphal, , , M Helmert. . Lama 2008 and 2011. . Int Planning Competition, , 2011. . p.117--124. . ..

S Thiébaux, , , J Hoffmann, , , B Nebel. . In defense of PDDL axioms. . Artif Intell, , 2005. . 168((1-2):):38--69. . DOI:10.1016/j.artint.2005.05.004http://doi.org/10.1016/j.artint.2005.05.004..

F Yang, , , P Khandelwal, , , M Leonetti, , , 等. . Planning in answer set programming while learning action costs for mobile robots. . AAAI Spring Symp on Knowledge Representation and Reasoning in Robotics, , 2014. . p.71--78. . ..

S Zhang, , , F Yang, , , P Khandelwal, , , 等. . Mobile robot planning using action language BC with an abstraction hierarchy. . Proc 13th Int Conf on Logic Programming and Nonmonotonic Reasoning, , 2015. . p.502--516. . DOI:10.1007/978-3-319-23264-5_42http://doi.org/10.1007/978-3-319-23264-5_42..

Views

Downloads

CSCD

Alert me when the article has been cited

Submit

Tools

Publicity Resources

KeJia: towards an autonomous service robot with tolerance of unexpected environmental changes

Friendship-aware task planning in mobile crowdsourcing

Related Author

Wei SHUAI

Xiao-ping CHEN

Yuan LIANG

Wei-feng LV

Wen-jun WU

Ke XU

Related Institution

Department of Computer Science and Technology, University of Science and Technology of China

State Key Laboratory of Software Development Environment, School of Computer Science, Beihang University

Address：Zhejiang University Press, 148 Tianmushan Road, Hangzhou, China Postal code：310028
Tel：+86-571-88273162 Email：fitee@zju.edu.cn
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰