Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Kinodynamic Planning

Optimization Algorithm

In robotics and motion planning, kinodynamic planning is a class of problems in which velocity, acceleration, and force or torque bounds must be satisfied together with kinematic constraints such as obstacle avoidance. The term was coined by the researchers Bruce Donald, Pat Xavier, John Canny, and John Reif. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Connections

Credited To

Bruce Donald, Pioneers
Source Wikipedia: Kinodynamic planning

In Field

Robotics, Fields
Source Wikipedia: Kinodynamic planning

Invented By

Bruce Donald, Pioneers
Source Wikipedia: Kinodynamic planning

Uses Design Technique

Source Wikipedia: Kinodynamic planning
Sources
Wikipedia: Kinodynamic planning
  • Lead section
    In robotics and motion planning, kinodynamic planning is a class of problems for which velocity, acceleration, and force/torque bounds must be satisfied, together with kinematic constraints such as avoiding obstacles.
  • Credited To: Bruce Donald, Lead
    The term was coined by Bruce Donald, Pat Xavier, John Canny, and John Reif.
  • Uses Design Technique: Approximation Algorithms, Lead
    Donald et al. developed the first polynomial-time approximation schemes (PTAS) for the problem.
  • In Group: Constraint-Based Planning and Generation Algorithms, Introduction
    In robotics and motion planning, kinodynamic planning is a class of problems for which velocity, acceleration, and force/torque bounds must be satisfied, together with kinematic constraints such as avoiding obstacles.
  • In Field: Robotics, Lead
    In robotics and motion planning, kinodynamic planning is a class of problems for which velocity, acceleration, and force/torque bounds must be satisfied, together with kinematic constraints such as avoiding obstacles.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.