IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v51y2019i7p766-776.html
   My bibliography  Save this article

Robust and energy efficient trajectories for robots in a common workspace setting

Author

Listed:
  • Nina Sundström
  • Oskar Wigström
  • Bengt Lennartson

Abstract

A method, incorporating robustness into trajectory planning, is proposed in this article. In the presence of delays, the suggested approach guarantees collision-free scenarios for robots with predefined paths and overlapping workspaces. Traditionally, only the time at which a robot can enter a common workspace is constrained so as to avoid collisions. If the shared zone becomes available later than planned, collisions can potentially occur if the robot is unable to stop before entering the shared space. In this work, a clearance point is introduced where the occupancy of the common workspace is evaluated. The velocity is constrained at this point such that, if necessary, the robot is able to stop at the boundary of the shared space. The closer to the boundary the evaluation is performed, the more restricted is the velocity. The problem formulation is stated in space assuming a predefined path, where robot dynamics and robust constraints are included. Multiple objectives corresponding to final time and energy consumption are considered. The impact on the system performance concerning the position and timing related to the clearance point is analyzed. An example is presented, where the optimal clearance point position is determined, based on the time at which the shared space is assumed to become available.

Suggested Citation

  • Nina Sundström & Oskar Wigström & Bengt Lennartson, 2019. "Robust and energy efficient trajectories for robots in a common workspace setting," IISE Transactions, Taylor & Francis Journals, vol. 51(7), pages 766-776, July.
  • Handle: RePEc:taf:uiiexx:v:51:y:2019:i:7:p:766-776
    DOI: 10.1080/24725854.2018.1542543
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2018.1542543
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2018.1542543?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uiiexx:v:51:y:2019:i:7:p:766-776. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.