Randomized kinodynamic planning

The paper presents a state-space perspective on the kinodynamic planning problem, and introduces a randomized path planning technique that computes collision-free kinodynamic trajectories for high degree-of-freedom problems. By using a state space formulation, the kinodynamic planning problem is tre...

Full description

Saved in:
Bibliographic Details
Main Authors: LaValle, S.M., Kuffner, J.J.
Format: Conference Proceeding
Language:English
Subjects:
Computer science
Kinematics
Mobile robots
Orbital robotics
Path planning
Space exploration
State-space methods
Trajectory
Vehicle dynamics
Velocity control
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c166t-3b0c8b2c7a3c78f5045f70b3b5b33b1cf2ae33d4769e18263110628e0b7704133
cites
container_end_page 479 vol.1
container_issue
container_start_page 473
container_title
container_volume 1
creator LaValle, S.M.
Kuffner, J.J.
description The paper presents a state-space perspective on the kinodynamic planning problem, and introduces a randomized path planning technique that computes collision-free kinodynamic trajectories for high degree-of-freedom problems. By using a state space formulation, the kinodynamic planning problem is treated as a 2n-dimensional nonholonomic planning problem, derived from an n-dimensional configuration space. The state space serves the same role as the configuration space for basic path planning. The bases for the approach is the construction of a tree that attempts to rapidly and uniformly explore the state space, offering benefits that are similar to those obtained by successful randomized planning methods, but applies to a much broader class of problems. Some preliminary results are discussed for an implementation that determines the kinodynamic trajectories for hovercrafts and satellites in cluttered environments resulting in state spaces of up to twelve dimensions.
doi_str_mv 10.1109/ROBOT.1999.770022
format conference_proceeding
fullrecord <record><control><sourceid>proquest_6IE</sourceid><recordid>TN_cdi_proquest_miscellaneous_27115747</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>770022</ieee_id><sourcerecordid>27115747</sourcerecordid><originalsourceid>FETCH-LOGICAL-c166t-3b0c8b2c7a3c78f5045f70b3b5b33b1cf2ae33d4769e18263110628e0b7704133</originalsourceid><addsrcrecordid>eNotkE1LAzEYhIMf4Fr7A_RiT962vsm7yZsctfgFhUKp4G1JslmJdnfrpj3UX-_CCgNzGYZnhrFrDnPOwdyvV4-rzZwbY-ZEAEKcsExIohw0fZyyqSENg1ByDeqMZRwk5AUJc8EuU_oCAESlMna7tm3VNfE3VLPv2HbVsbVN9LPd1rZtbD-v2HlttylM_33C3p-fNovXfLl6eVs8LHPPldrn6MBrJzxZ9KRrCYWsCRw66RAd97WwAbEqSJnAtVA4jFBCB3ADfcERJ-xu7N313c8hpH3ZxOTDdsAI3SGVgjiXVNAQvBmDMYRQ7vrY2P5Yjh_gH6k4S_M</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>27115747</pqid></control><display><type>conference_proceeding</type><title>Randomized kinodynamic planning</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>LaValle, S.M. ; Kuffner, J.J.</creator><creatorcontrib>LaValle, S.M. ; Kuffner, J.J.</creatorcontrib><description>The paper presents a state-space perspective on the kinodynamic planning problem, and introduces a randomized path planning technique that computes collision-free kinodynamic trajectories for high degree-of-freedom problems. By using a state space formulation, the kinodynamic planning problem is treated as a 2n-dimensional nonholonomic planning problem, derived from an n-dimensional configuration space. The state space serves the same role as the configuration space for basic path planning. The bases for the approach is the construction of a tree that attempts to rapidly and uniformly explore the state space, offering benefits that are similar to those obtained by successful randomized planning methods, but applies to a much broader class of problems. Some preliminary results are discussed for an implementation that determines the kinodynamic trajectories for hovercrafts and satellites in cluttered environments resulting in state spaces of up to twelve dimensions.</description><identifier>ISSN: 1050-4729</identifier><identifier>ISBN: 9780780351806</identifier><identifier>ISBN: 0780351800</identifier><identifier>EISSN: 2577-087X</identifier><identifier>DOI: 10.1109/ROBOT.1999.770022</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer science ; Kinematics ; Mobile robots ; Orbital robotics ; Path planning ; Space exploration ; State-space methods ; Trajectory ; Vehicle dynamics ; Velocity control</subject><ispartof>Proceedings - IEEE International Conference on Robotics and Automation, 1999, Vol.1, p.473-479 vol.1</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c166t-3b0c8b2c7a3c78f5045f70b3b5b33b1cf2ae33d4769e18263110628e0b7704133</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/770022$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,314,780,784,789,790,2058,4050,4051,27924,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/770022$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>LaValle, S.M.</creatorcontrib><creatorcontrib>Kuffner, J.J.</creatorcontrib><title>Randomized kinodynamic planning</title><title>Proceedings - IEEE International Conference on Robotics and Automation</title><addtitle>ROBOT</addtitle><description>The paper presents a state-space perspective on the kinodynamic planning problem, and introduces a randomized path planning technique that computes collision-free kinodynamic trajectories for high degree-of-freedom problems. By using a state space formulation, the kinodynamic planning problem is treated as a 2n-dimensional nonholonomic planning problem, derived from an n-dimensional configuration space. The state space serves the same role as the configuration space for basic path planning. The bases for the approach is the construction of a tree that attempts to rapidly and uniformly explore the state space, offering benefits that are similar to those obtained by successful randomized planning methods, but applies to a much broader class of problems. Some preliminary results are discussed for an implementation that determines the kinodynamic trajectories for hovercrafts and satellites in cluttered environments resulting in state spaces of up to twelve dimensions.</description><subject>Computer science</subject><subject>Kinematics</subject><subject>Mobile robots</subject><subject>Orbital robotics</subject><subject>Path planning</subject><subject>Space exploration</subject><subject>State-space methods</subject><subject>Trajectory</subject><subject>Vehicle dynamics</subject><subject>Velocity control</subject><issn>1050-4729</issn><issn>2577-087X</issn><isbn>9780780351806</isbn><isbn>0780351800</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1999</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotkE1LAzEYhIMf4Fr7A_RiT962vsm7yZsctfgFhUKp4G1JslmJdnfrpj3UX-_CCgNzGYZnhrFrDnPOwdyvV4-rzZwbY-ZEAEKcsExIohw0fZyyqSENg1ByDeqMZRwk5AUJc8EuU_oCAESlMna7tm3VNfE3VLPv2HbVsbVN9LPd1rZtbD-v2HlttylM_33C3p-fNovXfLl6eVs8LHPPldrn6MBrJzxZ9KRrCYWsCRw66RAd97WwAbEqSJnAtVA4jFBCB3ADfcERJ-xu7N313c8hpH3ZxOTDdsAI3SGVgjiXVNAQvBmDMYRQ7vrY2P5Yjh_gH6k4S_M</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>LaValle, S.M.</creator><creator>Kuffner, J.J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1999</creationdate><title>Randomized kinodynamic planning</title><author>LaValle, S.M. ; Kuffner, J.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c166t-3b0c8b2c7a3c78f5045f70b3b5b33b1cf2ae33d4769e18263110628e0b7704133</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Computer science</topic><topic>Kinematics</topic><topic>Mobile robots</topic><topic>Orbital robotics</topic><topic>Path planning</topic><topic>Space exploration</topic><topic>State-space methods</topic><topic>Trajectory</topic><topic>Vehicle dynamics</topic><topic>Velocity control</topic><toplevel>online_resources</toplevel><creatorcontrib>LaValle, S.M.</creatorcontrib><creatorcontrib>Kuffner, J.J.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEL</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LaValle, S.M.</au><au>Kuffner, J.J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Randomized kinodynamic planning</atitle><btitle>Proceedings - IEEE International Conference on Robotics and Automation</btitle><stitle>ROBOT</stitle><date>1999</date><risdate>1999</risdate><volume>1</volume><spage>473</spage><epage>479 vol.1</epage><pages>473-479 vol.1</pages><issn>1050-4729</issn><eissn>2577-087X</eissn><isbn>9780780351806</isbn><isbn>0780351800</isbn><abstract>The paper presents a state-space perspective on the kinodynamic planning problem, and introduces a randomized path planning technique that computes collision-free kinodynamic trajectories for high degree-of-freedom problems. By using a state space formulation, the kinodynamic planning problem is treated as a 2n-dimensional nonholonomic planning problem, derived from an n-dimensional configuration space. The state space serves the same role as the configuration space for basic path planning. The bases for the approach is the construction of a tree that attempts to rapidly and uniformly explore the state space, offering benefits that are similar to those obtained by successful randomized planning methods, but applies to a much broader class of problems. Some preliminary results are discussed for an implementation that determines the kinodynamic trajectories for hovercrafts and satellites in cluttered environments resulting in state spaces of up to twelve dimensions.</abstract><pub>IEEE</pub><doi>10.1109/ROBOT.1999.770022</doi><tpages>7</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1050-4729
ispartof Proceedings - IEEE International Conference on Robotics and Automation, 1999, Vol.1, p.473-479 vol.1
issn 1050-4729
2577-087X
language eng
recordid cdi_proquest_miscellaneous_27115747
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Computer science
Kinematics
Mobile robots
Orbital robotics
Path planning
Space exploration
State-space methods
Trajectory
Vehicle dynamics
Velocity control
title Randomized kinodynamic planning
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T07%3A22%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Randomized%20kinodynamic%20planning&rft.btitle=Proceedings%20-%20IEEE%20International%20Conference%20on%20Robotics%20and%20Automation&rft.au=LaValle,%20S.M.&rft.date=1999&rft.volume=1&rft.spage=473&rft.epage=479%20vol.1&rft.pages=473-479%20vol.1&rft.issn=1050-4729&rft.eissn=2577-087X&rft.isbn=9780780351806&rft.isbn_list=0780351800&rft_id=info:doi/10.1109/ROBOT.1999.770022&rft_dat=%3Cproquest_6IE%3E27115747%3C/proquest_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c166t-3b0c8b2c7a3c78f5045f70b3b5b33b1cf2ae33d4769e18263110628e0b7704133%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=27115747&rft_id=info:pmid/&rft_ieee_id=770022&rfr_iscdi=true