We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This paper presents a new approach for geometrically constrained path planning applied to the field of robotic grasping. The method proposed in this paper is based on the Fast Marching Square (FM
$\, ^2$
) and a path calculation approach based on an optimization evolutionary filter named Differential Evolution (DE). The geometric restrictions caused by the link lengths of the kinematic chain composed by the robot arm and hand are introduced in the path calculation phase. This phase uses both the funnel potential of the surroundings created with FM
$\, ^2$
and the kinematic constraints of the robot as cost functions to be minimized by the evolutionary filter. The use of an optimization filter allows for a near-optimal solution that satisfies the kinematic restrictions, while preserving the characteristics of a path computed with FM
$\, ^2$
. The proposed method is tested in a simulation using a robot composed by a mobile base with two arms.
The proposed algorithm integrates in a single planner the global motion planning and local obstacle avoidance capabilities. It efficiently guides the robot in a dynamic environment. This eliminates some of the traditional problems of planned architectures (model-plan-act scheme) while obtaining many of the qualities of behavior-based architectures. The computational efficiency of the method allows the planner to operate at high-rate sensor frequencies. This avoids the need for using both a collision-avoidance algorithm and a global motion planner for navigation in a cluttered environment. The method combines map-based and sensor-based planning operations to provide a smooth and reliable motion plan. Operating on a simple grid-based world model, the method uses a fast marching technique to determine a motion plan on a Voronoi extended transform extracted from the environment model. In addition to this real-time response ability, the method produces smooth and safe robot trajectories.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.