humanoidsdata.com

Search

Search companies, datasets, articles, and glossary terms for humanoids and embodied AI.

← All glossary terms

Hardware & control

Motion planning

Motion planning is the computation of a feasible path or trajectory that moves a robot from an initial condition toward a goal while satisfying constraints such as collision avoidance, joint limits, contact, balance, or dynamics. The planner searches over possible robot motions; a controller is still needed to execute the result.

Also known as: robot motion planning, robot path planning

Updated

Planning searches for a feasible motion

LaValle's Planning Algorithms treats motion planning through configuration spaces, constraints and search. A planner may work in joint space, task space or a combined state space. Sampling-based, search-based and optimisation-based methods explore that space in different ways.

A geometric path specifies an ordered route without timing. A trajectory adds time and may include velocity or acceleration. Dynamic planning must account for how controls and physical dynamics constrain the reachable motion.

A collision-free arm path may still fail a humanoid

Humanoid motion can require balance, contact schedules, whole-body coordination, self-collision avoidance and actuator limits. Planning only the hand path does not ensure that the body can follow it while keeping its feet stable.

The environment model also matters. Missing geometry, pose uncertainty or a moving person can invalidate a plan. Safety margins help but do not replace sensing and replanning.

Planning and control are separate layers

A planner proposes a path or trajectory; feedback control tracks it and responds to deviations. Model predictive control can repeatedly optimise a short horizon and therefore blur the boundary, but the execution loop still depends on state estimation and low-level control.

Planning datasets should retain start and goal conditions, robot and environment models, constraints, collision geometry, planner settings, costs, random seeds, success status and computation time. A smooth successful trajectory alone hides failed searches and says little about robustness.

Sources