Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5602Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Erdmann, Michael | - |
| dc.creator | Lozano-Perez, Tomas | - |
| dc.date | 2004-10-01T20:10:37Z | - |
| dc.date | 2004-10-01T20:10:37Z | - |
| dc.date | 1986-05-01 | - |
| dc.date.accessioned | 2013-10-09T02:40:15Z | - |
| dc.date.available | 2013-10-09T02:40:15Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-883 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5602 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | This paper explores the motion planning problem for multiple moving objects. The approach taken consists of assigning priorities to the objects, then planning motions one object at a time. For each moving object, the planner constructs a configuration space-time that represents the time-varying constraints imposed on the moving object by the other moving and stationary objects. The planner represents this space-time approximately, using two-dimensional slices. The space-time is then searched for a collision-free path. The paper demonstrates this approach in two domains. One domain consists of translating planar objects; the other domain consists of two-link planar articulated arms. | - |
| dc.format | 47 p. | - |
| dc.format | 6985757 bytes | - |
| dc.format | 2625576 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-883 | - |
| dc.subject | robotics | - |
| dc.subject | motion planning | - |
| dc.subject | collision avoidance | - |
| dc.subject | sconfiguration space | - |
| dc.subject | coordinated motion | - |
| dc.subject | autonomous robot | - |
| dc.title | On Multiple Moving Objects | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
