0

Full Content is available to subscribers

Subscribe/Learn More  >

Optimal Paths for Polygonal Robots in SE(2)

[+] Author Affiliations
Monroe Kennedy, III, Dinesh Thakur, Vijay Kumar

University of Pennsylvania, Philadelphia, PA

M. Ani Hsieh

Drexel University, Philadelphia, PA

Subhrajit Bhattacharya

Lehigh University, Bethlehem, PA

Paper No. DETC2017-67881, pp. V05BT08A075; 9 pages
doi:10.1115/DETC2017-67881
From:
  • ASME 2017 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference
  • Volume 5B: 41st Mechanisms and Robotics Conference
  • Cleveland, Ohio, USA, August 6–9, 2017
  • Conference Sponsors: Design Engineering Division, Computers and Information in Engineering Division
  • ISBN: 978-0-7918-5818-9
  • Copyright © 2017 by ASME

abstract

We consider navigation for a polygonal, holonomic robot in an obstacle filled environment in SE(2). We denote the configuration space of the robot as C. In order to determine the free space, obstacles are represented as point clouds then transformed into C. The point-wise Minkowski sum of the robot and obstacle points is then calculated in C by adding the vertices and points on the convex hull of robot to obstacle points for different robot configurations. We then find a seed path using either a graph search or sample based planner. This seed path is then used in our novel method to determine overlapping convex regions for each consecutive chord of the seed path. Our proposed method represents the collision free, traversable region by defining overlapping convex corridors defined by a set of linear constraints. Within these corridors we find feasible trajectories that optimize a specified cost functional. The generated corridors along with the initial and desired poses are then used to determine an optimal path that satisfies the specified objective within the same homotopy group as the seed path. The key contributions is the proposed methods’ ability to easily generate a set of convex, overlapping polytopes that effectively represent the traversable free space. This in turn lends itself to (a) efficient computation of optimal paths, and (b) extending these basic ideas to non-Euclidean spaces such as SE(2). We provide simulated examples and implement this algorithm on the KUKA youBot omni-directional base.

Copyright © 2017 by ASME
Topics: Robots

Figures

Tables

Interactive Graphics

Video

Country-Specific Mortality and Growth Failure in Infancy and Yound Children and Association With Material Stature

Use interactive graphics and maps to view and sort country-specific infant and early dhildhood mortality and growth failure data and their association with maternal

NOTE:
Citing articles are presented as examples only. In non-demo SCM6 implementation, integration with CrossRef’s "Cited By" API will populate this tab (http://www.crossref.org/citedby.html).

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In