Hybrid planning for challenging construction problems: an answer set programming approach

DOI10.1016/J.ARTINT.2023.103902MaRDI QIDQ6161492zbMATH OpenFDO

Authors Faseeh Ahmad, Volkan Patoglu, Esra Erdem

Publication date 27 June 2023

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.00745

zbMATH Keywords

answer set programmingconstruction problemshybrid planning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Abstract: We study robot construction problems where multiple autonomous robots rearrange stacks of prefabricated blocks to build stable structures. These problems are challenging due to ramifications of actions, true concurrency, and requirements of supportedness of blocks by other blocks and stability of the structure at all times. We propose a formal hybrid planning framework to solve a wide range of robot construction problems, based on Answer Set Programming. This framework not only decides for a stable final configuration of the structure, but also computes the order of manipulation tasks for multiple autonomous robots to build the structure from an initial configuration, while simultaneously ensuring the stability, supportedness and other desired properties of the partial construction at each step of the plan. We prove the soundness and completeness of our formal method with respect to these properties. We introduce a set of challenging robot construction benchmark instances, including bridge building and stack overhanging scenarios, discuss the usefulness of our framework over these instances, and demonstrate the applicability of our method using a bimanual Baxter robot.

Cites work

• A computational model for the limit analysis of three-dimensional masonry structures
• A model building framework for answer set programming with external computations
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Efficient HEX-Program Evaluation Based on Unfounded Sets
• Extending classical planning with state constraints: heuristics and search for optimal planning
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 2119667 (Why is no real title available?)
• scientific article; zbMATH DE number 1453059 (Why is no real title available?)
• scientific article; zbMATH DE number 5212421 (Why is no real title available?)
• Human robot collaborative assembly planning: an answer set programming approach
• In defense of PDDL axioms
• KABouM: Knowledge-Level Action and Bounding Geometry Motion Planner
• Limit analysis of structures formed from rigid blocks
• Maximum overhang
• Monadic generalized spectra
• Nonmonotonic causal theories
• On the complexity of blocks-world planning
• Overhang
• Overhang
• Planning Algorithms
• Planning among movable obstacles with artificial constraints
• Prolegomena to a theory of mechanized formal reasoning
• Pushing blocks is hard.
• Semantics and complexity of recursive aggregates in answer set programming
• Stability Characterizations of Rigid Body Contact Problems with Coulomb Friction
• Tight logic programs

This page was built for publication: Hybrid planning for challenging construction problems: an answer set programming approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161492)