The control system of a robot operating in a human-centered environments should address the problem of motion planning to generate collision-free motions for grasping and manipulation tasks. To deal with the complexity of these tasks in such environments, different motion planning algorithms can be used. We present a motion planning framework for manipulation and grasping tasks consisting of di...

In this commentary I argue that although pddl2.1 is a very useful standard for the planning competition, its design does not properly consider the issue of domain modeling. Hence, I would not advocate its use in specifying planning domains outside of the context of the planning competition. Rather, the field needs to explore different approaches and grapple more directly with the problem of eff...

In this commentary I argue that although pddl2.1 is a very useful standard for the planning competition, its design does not properly consider the issue of domain modeling. Hence, I would not advocate its use in specifying planning domains outside of the context of the planning competition. Rather, the field needs to explore different approaches and grapple more directly with the problem of eff...

Intentional use of contact gains ground in the motion planning filed by exploiting it to reduce uncertainty. Our approach extends contact motion planning to reacts to contact events. Our reactive planner augments the state space by taking in consideration continuous and discrete events. We differentiate discrete contact events that can occur during the execution due to motion uncertainty. This ...

We present a path-planning algorithm for the classical mover's problem in three dimensions using a potential field representation of obstacles. A potential function similar to the electrostatic potential is assigned to each obstacle, and the topological structure of the free space is derived in the form of minimum potential valleys. Path planing is done at two levels. First, a global planner se...

The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains. Although they are commonly used for the purpose of evaluating planner performance, the planning domains themselves have not yet been studied in depth. In this contribution, we prove complexity results for the decision...

Stability and performance are two main issues in motion of bipeds. To ensure stability of motion, a biped needs to follow specific pattern to comply with a stability criterion such as zero moment point. However, there are infinity many patterns of motion which ensure stability, so one might think of achieving better performance by choosing proper parameters of motion. Step length and step perio...

We study an elementary problem of the topological robotics: collective motion of a set of n distinct particles which one has to move from an initial configuration to a final configuration, with the requirement that no collisions occur in the process of motion. The ultimate goal is to construct an algorithm which will perform this task once the initial and the final configurations are given. Thi...

This chapter describes kinodynamic motion planning and its application. Kinodynamics is the discipline that tries to solve kinematic constraints and dynamical constraints simultaneously. By using kinodynamic motion planning, control inputs can be generated in a much simpler way, compared to the conventional motion planning that solves kinematics and dynamics separately. After briefly overviewin...

This work makes two contributions to geometric motion planning for multiple robots: i) Motion plans are computed that simultaneously optimize an independent performance measure for each robot; ii) A general spectrum is deened between decoupled and centralized planning, in which we introduce coordination along independent roadmaps. By considering independent performance measures, we introduce a ...