Planning efficiently at task and motion levels allows the setting of new challenges for robotic manipulation problems, like for instance constrained table-top problems for bi-manual robots. In this scope, the appropriate combination of task and motion planning levels plays an important role. Accordingly, a heuristic-based task and motion planning approach is proposed, in which the computation of the heuristic addresses a geometrically relaxed problem, i.e., it only reasons upon objects placements, grasp poses, and inverse kinematics solutions. Motion paths are evaluated lazily, i.e., only after an action has been selected by the heuristic. This reduces the number of calls to the motion planner, while backtracking is reduced because the heuristic captures most of the geometric constraints. The approach has been validated in simulation and on a real robot, with different classes of table-top manipulation problems. Empirical comparison with recent approaches solving similar problems is also reported, showing that the proposed approach results in significant improvement both in terms of planing time and success rate.

This paper discusses potential limitations in learning in au-tonomous robotic systems that integrate several specialized subsystemsworking at different levels of abstraction. If the designers have antici-pated what the system may have to learn, then adding new knowledgeboils down to adding new entries in a database and/or tuning parametersof some subsystem(s). But if this new knowledge does not fit in prede-fined structures, the system can simply not acquire it, hence it cannot“think out of the box” designed by its creators. We show why learningout of the box may be difficult in integrated systems, hint at some exist-ing potential approaches, and finally suggest that a better approach maycome by looking at constructivist epistemology, with focus on Piaget’sschemas theory.

We present the first platform-independent evaluation method for task and motion planning (TAMP). Previously point, various problems have been used to test individual planners for specific aspects of TAMP. However, no common set of metrics, formats, and problems have been accepted by the community. We propose a set of benchmark problems covering the challenging aspects of TAMP and a planner-independent specification format for these problems. Our objective is to better evaluate and compare TAMP planners, foster communication, and progress within the field, and lay a foundation to better understand this class of planning problems.

Planners for real robotic systems should not only reason about abstract actions, but also about aspects related to physical execution such as kinematics and geometry. We present an approach to hybrid task and motion planning, in which state-based forward-chaining task planning is tightly coupled with motion planning and other forms of geometric reasoning. Our approach is centered around the problem of geometric backtracking that arises in hybrid task and motion planning: in order to satisfy the geometric preconditions of the current action, a planner may need to reconsider geometric choices, such as grasps and poses, that were made for previous actions. Geometric backtracking is a necessary condition for completeness, but it may lead to a dramatic computational explosion due to the large size of the space of geometric states. We explore two avenues to deal with this issue: the use of heuristics based on different geometric conditions to guide the search, and the use of geometric constraints to prune the search space. We empirically evaluate these different approaches, and demonstrate that they improve the performance of hybrid task and motion planning. We demonstrate our hybrid planning approach in two domains: a real, humanoid robotic platform, the DLR Justin robot, performing object manipulation tasks; and a simulated autonomous forklift operating in a warehouse.

We introduce a variant of the multi-vehicle routing problem which accounts for nonholonomic constraints and dense, dynamic obstacles, called MVRP-DDO. The problem is strongly motivated by an industrial mining application. This paper illustrates how MVRP-DDO relates to other extensions of the vehicle routing problem. We provide an application-independent formulation of MVRP-DDO, as well as a concrete instantiation in a surface mining application. We propose a multi-abstraction search approach to compute an executable plan for the drilling operations of several machines in a very constrained environment. The approach is evaluated in terms of makespan and computation time, both of which are hard industrial requirements.

This thesis addresses the problem of automatically computing, given a high-level goal description, a sequence of actions and motion paths for one or several robots to achieve that goal. Also referred to as CTAMP (Combining Task And Motion Planning), this problem may seem trivial at first glance, since efficient solutions have been found for its two underlying problems, namely task planning and motion planning. However, further consideration reveals that combining task and motion planning, in many cases, is not straightforward. We have identified two important issues which are addressed in this thesis.

The first issue originates in the fact that symbolic actions can be geometrically instantiated in multiple ways. Choosing a geometric instance for each action is not trivial, because a “wrong” choice may compromise the feasibility of subsequent actions. To address this issue, in the first part of the thesis we propose a mechanism for backtracking over geometric choices in the context of a partial symbolic plan. This process may greatly increase the complexity of CTAMP. Therefore, we also present a constraint-based approach for pruning out geometric configurations which violate a number of geometric constraints imposed by the action sequence, and by the kinematic models of robots. This approach has been tested with success on the real humanoid robotic platform Justin in the context of the GeRT1 project.

The second issue results from the necessity to interleave symbolic and geometric computations for taking geometric constraints into account at the symbolic level. Indeed, the symbolic search space forms an abstraction of the physical world, hence geometric constraints such as objects occlusions or kinematic constraints are not represented. However, interleaving both search processes is not a workable approach for large problem instances, because the resulting search space is too large. In the second part of the thesis, we propose a novel approach for decoupling symbolic and geometric search spaces, while keeping the symbolic level aware of geometric constraints. Culprit detection mechanisms are used for computing explanations for geometric failures, and these explanations are leveraged at the symbolic level for pruning the search space through inference mechanisms. This approach has been extensively tested in simulation, on different types of single and multiple robot systems.

Solving problems combining task and motion planning requires searching across a symbolic search space and a geometricsearch space. Because of the semantic gap between symbolic and geometric representations, symbolic sequences of actionsare not guaranteed to be geometrically feasible. This compels us to search in the combined search space, in which frequentbacktracks between symbolic and geometric levels make the search inefficient. We address this problem by guiding symbolicsearch with rich information extracted from the geometric level through culprit detection mechanisms.

We propose a constraint-based approach to address a class of problems encountered in combined task and motion planning (CTAMP), which we call kinematically constrained problems. CTAMP is a hybrid planning process in which task planning and geometric reasoning are interleaved. During this process, symbolic action sequences generated by a task planner are geometrically evaluated. This geometric evaluation is a search problem per se, which we refer to as geometric backtrack search. In kinematically constrained problems, a significant computational effort is spent on geometric backtrack search, which impairs search at the task level. At the basis of our approach to address this problem, is the introduction of an intermediate layer between task planning and geometric reasoning. A set of constraints is automatically generated from the symbolic action sequences to evaluate, and combined with a set of constraints derived from the kinematic model of the robot. The resulting constraint network is then used to prune the search space during geometric backtrack search. We present experimental evidence that our approach significantly reduces the complexity of geometric backtrack search on various types of problem.

Combining task and motion planning requires tointerleave causal and geometric reasoning, in order to guaranteethe plan to be executable in the real world. The resulting searchspace, which is the cross product of the symbolic search spaceand the geometric search space, is huge. Systematically calling ageometric reasoner while evaluating symbolic actions is costly. Onthe other hand, geometric reasoning can prune out large parts ofthis search space if geometrically infeasible actions are detectedearly. Hence, we hypothesized the existence of a search depthlevel, until which geometric reasoning can be interleaved withsymbolic reasoning with tractable combinatorial explosion, whilekeeping the benefits of this pruning. In this paper, we propose asimple model that proves the existence of such search depth level,and validate it empirically through experiments in simulation