Online ordering is currently unavailable due to technical issues. We apologise for any delays responding to customers while we resolve this. For further updates please visit our website: https://www.cambridge.org/news-and-insights/technical-incident
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 coreplatform@cambridge.org
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.
Collision-Avoidance is a key issue in planning trajectories for dual robots whose workspaces overlap. In this paper, we develop a new trajectory planning method by proposing a traffic control schemes. The traffic controller determines the next positions for each robot based on the motion priority and path direction subject to the collision-avoidance conditions and the robots' physical limits. The problem of determining the next positions is formulated and optimized. Algebraic expressions for collision avoidance between every-pair of links – one from the first robot and the other from the second robot – are derived in configuration space. These algebraic expressions are then used to solve the problem of determining “optimal” (in the sense of path direction and motion priority) robots' trajectories. A solution procedure is developed using a nonlinear programming (NLP) solver. The main advantage of our approach is that the two robots' trajectories can be determined simultaneously without requiring any a priori path information. Several numerical examples are presented to demonstrate the validity and effectiveness of the proposed approach.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.