Housekeeping with multiple autonomous robots: representation, reasoning, and execution

Aker, Erdi (2013) Housekeeping with multiple autonomous robots: representation, reasoning, and execution. [Thesis]

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://risc01.sabanciuniv.edu/record=b1534418 (Table of Contents)


We consider a housekeeping domain with static or movable objects, where the goal is for multiple autonomous robots to tidy a house collaboratively in a given amount of time. This domain is challenging in the following ways: commonsense knowledge (e.g., expected locations of objects in the house) is required for intelligent behavior of robots; geometric constraints are required to find feasible plans (e.g., to avoid collisions); in case of plan failure while execution (e.g., due to a collision with movable objects whose presence and location are not known in advance or due to heavy objects that cannot be lifted by a single robot), recovery is required depending on the cause of failure; and collaboration of robots is required to complete some tasks (e.g., carrying heavy objects). We introduce a formal planning, execution and monitoring framework to address the challenges of this domain, by embedding knowledge representation and automated reasoning in each level of decision-making (that consists of discrete task planning, continuous motion planning, and plan execution), in such a way as to tightly integrate these levels. At the high-level, we represent not only actions and change but also commonsense knowledge in a logicbased formalism. Geometric reasoning is lifted to the high-level by embedding motion planning in the domain description. Then a discrete plan is computed for each robot using an automated reasoner. At the mid-level, if a continuous trajectory cannot be computed by a motion planner because the discrete plan is not feasible at the continuous-level, then a different plan is computed by the automated reasoner subject to some (temporal) conditions represented as formulas. At the low-level, if the plan execution fails, then a new continuous trajectory is computed by a motion planner at the mid-level or a new discrete plan is computed using an automated reasoner at the high-level. We illustrate the applicability of this formal framework with a simulation of a housekeeping domain.

Item Type:Thesis
Uncontrolled Keywords:Domestic service robot. -- Answer set programming. -- Commonsense knowledge. -- Robotics. -- Artificial intelligence. -- Robotik. -- Yapay zeka. -- Ev içi hizmet robotu. -- Çözüm kümesi programlama. --Sağduyusal bilgi.
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK7800-8360 Electronics > TK7885-7895 Computer engineering. Computer hardware
ID Code:31020
Deposited By:IC-Cataloging
Deposited On:30 Dec 2016 16:07
Last Modified:30 Dec 2016 16:07

Repository Staff Only: item control page