Kinodynamic Motion Planning for an X4-Flyer

Author(s):  
Kimiko Motonaka ◽  
Keigo Watanabe ◽  
Shoichi Maeyama

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 overviewing the kinodynamic motion planning, its application to a flying robot is described in detail.

Author(s):  
Veljko Potkonjak ◽  
Miomir Vukobratovic ◽  
Kalman Babkovic ◽  
Branislav Borovac

This chapter relates biomechanics to robotics. The mathematical models are derived to cover the kinematics and dynamics of virtually any motion of a human or a humanoid robot. Benefits for humanoid robots are seen in fully dynamic control and a general simulator for the purpose of system designing and motion planning. Biomechanics in sports and medicine can use these as a tool for mathematical analysis of motion and disorders. Better results in sports and improved diagnostics are foreseen. This work is a step towards the biologically-inspired robot control needed for a diversity of tasks expected in humanoids, and robotic assistive devices helping people to overcome disabilities or augment their physical potentials. This text deals mainly with examples coming from sports in order to justify this aspect of research.


Author(s):  
Amit Ailon

The paper solves some control problems of mobile robots as both kinematics and dynamics are intertwined in the mathematical model. The problems of driving the vehicle to a desired configuration in a specified time and tracking a reference trajectory are considered. The control problems associated with motion in convoy and rigid formations of a group of vehicles are studied and some results are demonstrated by numerical examples.


2008 ◽  
Vol 130 (11) ◽  
Author(s):  
Anurag Purwar ◽  
Zhe Jin ◽  
Q. J. Ge

This paper deals with the problem of synthesizing smooth piecewise rational spherical motions of an object that satisfies the kinematic constraints imposed by a spherical robot arm with revolute joints. This paper brings together the kinematics of spherical robot arms and recently developed freeform rational motions to study the problem of synthesizing constrained rational motions for Cartesian motion planning. The kinematic constraints under consideration are workspace related constraints that limit the orientation of the end link of robot arms. This paper extends our previous work on synthesis of rational motions under the kinematic constraints of planar robot arms. Using quaternion kinematics of spherical arms, it is shown that the problem of synthesizing the Cartesian rational motion of a 2R arm can be reduced to that of circular interpolation in two separate planes. Furthermore, the problem of synthesizing the Cartesian rational motion of a spherical 3R arm can be reduced to that of constrained spline interpolation in two separate planes. We present algorithms for the generation of C1 and C2 continuous rational motion of spherical 2R and 3R robot arms.


2006 ◽  
Vol 129 (10) ◽  
pp. 1031-1036 ◽  
Author(s):  
Zhe Jin ◽  
Q. J. Ge

This paper deals with the problem of synthesizing piecewise rational motions of an object that satisfies kinematic constraints imposed by a planar robot arm with revolute joints. This paper brings together the kinematics of planar robot arms and the recently developed freeform rational motions to study the problem of synthesizing constrained rational motions for Cartesian motion planning. Through the use of planar quaternions, it is shown that for the case of a planar 2R arm, the problem of rational motion synthesis can be reduced to that of circular interpolations in two separate planes and that for the case of a planar 3R arm, the problem can be reduced to a combination of circular interpolation in one plane and a constrained spline interpolation in a circular ring on another plane. Due to the limitation of circular interpolation, only C1 continuous rational motions are generated that satisfy the kinematic constraints exactly. For applications that require C2 continuous motions, this paper presents a method for generating C2 continuous motions that approximate the kinematic constraints for planar 2R and 3R robot arms.


2016 ◽  
Vol 2016 ◽  
pp. 1-22 ◽  
Author(s):  
Liang Yang ◽  
Juntong Qi ◽  
Dalei Song ◽  
Jizhong Xiao ◽  
Jianda Han ◽  
...  

Robot 3D (three-dimension) path planning targets for finding an optimal and collision-free path in a 3D workspace while taking into account kinematic constraints (including geometric, physical, and temporal constraints). The purpose of path planning, unlike motion planning which must be taken into consideration of dynamics, is to find a kinematically optimal path with the least time as well as model the environment completely. We discuss the fundamentals of these most successful robot 3D path planning algorithms which have been developed in recent years and concentrate on universally applicable algorithms which can be implemented in aerial robots, ground robots, and underwater robots. This paper classifies all the methods into five categories based on their exploring mechanisms and proposes a category, called multifusion based algorithms. For all these algorithms, they are analyzed from a time efficiency and implementable area perspective. Furthermore a comprehensive applicable analysis for each kind of method is presented after considering their merits and weaknesses.


Robotica ◽  
1997 ◽  
Vol 15 (5) ◽  
pp. 547-553 ◽  
Author(s):  
K. Jiang ◽  
L.D. Seneviratne ◽  
S.W.E. Earles

This paper presents a novel time-optimal motion planning strategy for a mobile robot with kinematic constraints. The method works in environments in presence of obstacles, without needing to generate the configuration space for the robot. Further, it derives a minimum time first derivative smooth path, as opposed to a minimum distance path which is commonly given by various present solution techniques. The problem is solved in three stages: (i) A reduced visibility graph for a point object is obtained. (ii) The reduced visibility graph is converted into a feasible reduced visibility graph accounting for the size and kinematic constraints of the robot. (iii) The A* algorithm is used to search the feasible reduced visibility graph with the cost function being the time of travel, to obtain a safe, time-optimal, smooth path. The algorithm runs in polynomial time. The method has been tested in computer simulations and test results are presented


2011 ◽  
pp. 998-1022
Author(s):  
Veljko Potkonjak ◽  
Miomir Vukobratovic ◽  
Kalman Babkovic ◽  
Branislav Borovac

This chapter relates biomechanics to robotics. The mathematical models are derived to cover the kinematics and dynamics of virtually any motion of a human or a humanoid robot. Benefits for humanoid robots are seen in fully dynamic control and a general simulator for the purpose of system designing and motion planning. Biomechanics in sports and medicine can use these as a tool for mathematical analysis of motion and disorders. Better results in sports and improved diagnostics are foreseen. This work is a step towards the biologically-inspired robot control needed for a diversity of tasks expected in humanoids, and robotic assistive devices helping people to overcome disabilities or augment their physical potentials. This text deals mainly with examples coming from sports in order to justify this aspect of research.


Sign in / Sign up

Export Citation Format

Share Document