{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:24:57Z","timestamp":1768447497780,"version":"3.49.0"},"reference-count":41,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T00:00:00Z","timestamp":1503360000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a parallel offline algorithm for computing hybrid conditional plans, called HCP-ASP, oriented towards robotics applications. HCP-ASP relies on modeling actuation actions and sensing actions in an expressive nonmonotonic language of answer set programming (ASP), and computation of the branches of a conditional plan in parallel using an ASP solver. In particular, thanks to external atoms, continuous feasibility checks (like collision checks) are embedded into formal representations of actuation actions and sensing actions in ASP; and thus each branch of a hybrid conditional plan describes a feasible execution of actions to reach their goals. Utilizing nonmonotonic constructs and nondeterministic choices, partial knowledge about states and nondeterministic effects of sensing actions can be explicitly formalized in ASP; and thus each branch of a conditional plan can be computed by an ASP solver without necessitating a conformant planner and an ordering of sensing actions in advance. We apply our method in a service robotics domain and report experimental evaluations. Furthermore, we present performance comparisons with other compilation based conditional planners on standardized benchmark domains.<\/jats:p>","DOI":"10.1017\/s1471068417000321","type":"journal-article","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T12:14:35Z","timestamp":1503404075000},"page":"1027-1047","source":"Crossref","is-referenced-by-count":16,"title":["Hybrid conditional planning using answer set programming"],"prefix":"10.1017","volume":"17","author":[{"given":"IBRAHIM FARUK","family":"YALCINER","sequence":"first","affiliation":[]},{"given":"AHMED","family":"NOUMAN","sequence":"additional","affiliation":[]},{"given":"VOLKAN","family":"PATOGLU","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8384-7810","authenticated-orcid":false,"given":"ESRA","family":"ERDEM","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2017,8,22]]},"reference":[{"key":"S1471068417000321_ref22","unstructured":"Hertle A. , Dornhege C. , Keller T. and Nebel B. 2012. Planning with semantic attachments: An object-oriented view. In Proc. of ECAI, 402\u2013407."},{"key":"S1471068417000321_ref8","doi-asserted-by":"crossref","unstructured":"Caldiran O. , Haspalamutgil K. , Ok A. , Palaz C. , Erdem E. and Patoglu V. 2009. Bridging the gap between high-level reasoning and low-level control. In Proc. of LPNMR.","DOI":"10.1007\/978-3-642-04238-6_29"},{"key":"S1471068417000321_ref25","unstructured":"Komarnitsky R. and Shani G. 2016. Computing contingent plans using online replanning. In Proc. of AAAI, 3159\u20133165."},{"key":"S1471068417000321_ref21","unstructured":"Hauser K. and Latombe J.-C. 2009. Integrating task and PRM motion planning: Dealing with many infeasible motion planning queries. In BTAMP at ICAPS."},{"key":"S1471068417000321_ref5","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.3711","article-title":"Replanning in domains with partial information and sensing actions","volume":"45","author":"Brafman","year":"2012","journal-title":"JAIR"},{"key":"S1471068417000321_ref4","unstructured":"Bonet B. and Geffner H. 2011. Planning under partial observability by classical replanning: Theory and experiments. In Proc. of IJCAI, 1936\u20131941."},{"key":"S1471068417000321_ref34","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1613\/jair.277","article-title":"Planning for contingencies: A decision-based approach","volume":"4","author":"Pryor","year":"1996","journal-title":"JAIR"},{"key":"S1471068417000321_ref31","doi-asserted-by":"crossref","unstructured":"Peot M. A. and Smith D. E. 1992. Conditional nonlinear planning. In Proc. of AIPS, 189\u2013197.","DOI":"10.1016\/B978-0-08-049944-4.50027-6"},{"key":"S1471068417000321_ref23","unstructured":"Hoffmann J. and Brafman R. I. 2005. Contingent planning via heuristic forward search with implicit belief states. In Proc. of ICAPS, 71\u201380."},{"key":"S1471068417000321_ref40","unstructured":"Weld D. S. , Anderson C. R. and Smith D. E. 1998. Extending graphplan to handle uncertainty & sensing actions. In Proc. of AAAI, 897\u2013904."},{"key":"S1471068417000321_ref7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1613\/jair.1869","article-title":"Planning graph heuristics for belief space search","volume":"26","author":"Bryce","year":"2006","journal-title":"JAIR"},{"key":"S1471068417000321_ref29","unstructured":"Muise C. J. , Belle V. and McIlraith S. A. 2014. Computing contingent plans via fully observable non-deterministic planning. In Proc. of AAAI, 2322\u20132329."},{"key":"S1471068417000321_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2002.12.001"},{"key":"S1471068417000321_ref30","doi-asserted-by":"crossref","unstructured":"Nouman A. , Yalciner I. F. , Erdem E. and Patoglu V. 2016. Experimental evaluation of hybrid conditional planning for service robotics. In Proc. of ISER.","DOI":"10.1007\/978-3-319-50115-4_60"},{"key":"S1471068417000321_ref2","unstructured":"Albore A. , Palacios H. and Geffner H. 2009. A translation-based approach to contingent planning. In Proc. of IJCAI, 1623\u20131628."},{"key":"S1471068417000321_ref24","first-page":"1194","article-title":"Integrated task and motion planning in belief space","volume":"32","author":"Kaelbling","year":"2013","journal-title":"IJRR"},{"key":"S1471068417000321_ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i3.2669"},{"key":"S1471068417000321_ref9","doi-asserted-by":"crossref","unstructured":"Dantam N. T. , Kingston Z. K. , Chaudhuri S. and Kavraki L. E. 2016. Incremental task and motion planning: A constraint-based approach. In Proc. of RSS.","DOI":"10.15607\/RSS.2016.XII.002"},{"key":"S1471068417000321_ref13","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-150697"},{"key":"S1471068417000321_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00080-K"},{"key":"S1471068417000321_ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i3.2678"},{"key":"S1471068417000321_ref28","doi-asserted-by":"crossref","unstructured":"Maliah S. , Brafman R. I. , Karpas E. and Shani G. 2014. Partially observable online contingent planning using landmark heuristics. In Proc. of ICAPS.","DOI":"10.1609\/icaps.v24i1.13632"},{"key":"S1471068417000321_ref1","doi-asserted-by":"crossref","unstructured":"Albore A. , Palacios H. and Geffner H. 2007. Fast and informed action selection for planning with sensing. In Proc. of CAEPIA, 1\u201310.","DOI":"10.1007\/978-3-540-75271-4_1"},{"key":"S1471068417000321_ref26","doi-asserted-by":"crossref","unstructured":"Kuffner J. Jr and LaValle S. 2000. RRT-connect: An efficient approach to single-query path planning. In Proc. of ICRA, 995\u20131001.","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"S1471068417000321_ref15","doi-asserted-by":"crossref","unstructured":"Gaschler A. , Petrick R. P. , Giuliani M. , Rickert M. and Knoll A. 2013. KVP: A knowledge of volumes approach to robot task planning. In Proc. of IROS.","DOI":"10.1109\/IROS.2013.6696354"},{"key":"S1471068417000321_ref37","doi-asserted-by":"crossref","unstructured":"To S. T. , Son T. C. and Pontelli E. 2011. Contingent planning as AND\/OR forward search with disjunctive representation. In Proc. of ICAPS.","DOI":"10.1609\/icaps.v21i1.13477"},{"key":"S1471068417000321_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00080-1"},{"key":"S1471068417000321_ref16","unstructured":"Gebser M. , Kaminski R. , Kaufmann B. and Schaub T. 2014. Clingo = ASP + control: Preliminary report. In Technical Communications of ICLP, vol. 14(4\u20135). TPLP, Online supplement."},{"key":"S1471068417000321_ref10","unstructured":"Eiter T. , Ianni G. , Schindlauer R. and Tompits H. 2005. A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In Proc. of IJCAI, 90\u201396."},{"key":"S1471068417000321_ref39","unstructured":"Warren D. H. D. 1976. Generating conditional plans and programs. In Proc. of AISB, 344\u2013354."},{"key":"S1471068417000321_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068417000321_ref27","first-page":"1726","article-title":"Efficiently combining task and motion planning using geometric constraints","volume":"33","author":"Lagriffoul","year":"2014","journal-title":"IJRR"},{"key":"S1471068417000321_ref38","first-page":"377","article-title":"Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming","volume":"7","author":"Tu","year":"2007","journal-title":"TPLP"},{"key":"S1471068417000321_ref12","doi-asserted-by":"crossref","unstructured":"Erdem E. , Haspalamutgil K. , Palaz C. , Patoglu V. and Uras T. 2011. Combining high-level causal reasoning with low-level geometric reasoning and motion planning for robotic manipulation. In Proc. of ICRA.","DOI":"10.1109\/ICRA.2011.5980160"},{"key":"S1471068417000321_ref33","doi-asserted-by":"crossref","unstructured":"Plaku E. 2012. Planning in discrete and continuous spaces: From LTL tasks to robot motions. In Proc. of TAROS, 331\u2013342.","DOI":"10.1007\/978-3-642-32527-4_30"},{"key":"S1471068417000321_ref41","doi-asserted-by":"crossref","unstructured":"Weyhrauch R. W. 1978. Prolegomena to a Theory of Formal Reasoning. Technical report, Stanford University.","DOI":"10.21236\/ADA065698"},{"key":"S1471068417000321_ref3","unstructured":"Baral C. , Kreinovich V. and Trejo R. 1999. Computational complexity of planning and approximate planning in presence of incompleteness. In Proc. of IJCAI, 948\u2013955."},{"key":"S1471068417000321_ref20","unstructured":"Gravot F. , Cambon S. and Alami R. 2005. aSyMov:A Planner that deals with intricate symbolic and geometric problems. In Proc. of ISRR, 100\u2013110."},{"key":"S1471068417000321_ref36","doi-asserted-by":"crossref","unstructured":"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. In Proc. of ICRA.","DOI":"10.1109\/ICRA.2014.6906922"},{"key":"S1471068417000321_ref19","unstructured":"Goldman R. P. and Boddy M. S. 1996. Expressive planning and explicit knowledge. In Proc. of AIPS, 110\u2013117."},{"key":"S1471068417000321_ref32","unstructured":"Petrick R. P. A. and Bacchus F. 2002. A knowledge-based approach to planning with incomplete information and sensing. In Proc. of AIPS, 212\u2013222."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068417000321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T05:35:37Z","timestamp":1692941737000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068417000321\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,22]]},"references-count":41,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["S1471068417000321"],"URL":"https:\/\/doi.org\/10.1017\/s1471068417000321","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,22]]}}}