A travel-time optimizing edge weighting scheme for dynamic re-planning

Andrew Feit, Lenrik Toval, Raffi Hovagimian, Rachel Greenstadt

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    The success of autonomous vehicles has made path planning in real, physically grounded environments an increasingly important problem. In environments where speed matters and vehicles must maneuver around obstructions, such as autonomous car navigation in hostile environments, the speed with which real vehicles can traverse a path is often dependent on the sharpness of the corners on the path as well as the length of path edges. We present an algorithm that incorporates the use of the turn angle through path nodes as a limiting factor for vehicle speed. Vehicle speed is then used in a time-weighting calculation for each edge. This allows the path planning algorithm to choose potentially longer paths, with less turns in order to minimize path traversal time. Results simulated in the Breve environment show that travel time can be reduced over the solution obtained using the Anytime D* Algorithm by approximately 10% for a vehicle that is speed limited based on turn rate.

    Original languageEnglish (US)
    Title of host publicationBridging the Gap Between Task and Motion Planning - Papers from the 2010 AAAI Workshop, Technical Report
    Pages26-32
    Number of pages7
    StatePublished - Dec 1 2010
    Event2010 AAAI Workshop - Atlanta, GA, United States
    Duration: Jul 11 2010Jul 11 2010

    Publication series

    NameAAAI Workshop - Technical Report
    VolumeWS-10-01

    Conference

    Conference2010 AAAI Workshop
    CountryUnited States
    CityAtlanta, GA
    Period7/11/107/11/10

    Fingerprint

    Travel time
    Planning
    Motion planning
    Navigation
    Railroad cars

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Feit, A., Toval, L., Hovagimian, R., & Greenstadt, R. (2010). A travel-time optimizing edge weighting scheme for dynamic re-planning. In Bridging the Gap Between Task and Motion Planning - Papers from the 2010 AAAI Workshop, Technical Report (pp. 26-32). (AAAI Workshop - Technical Report; Vol. WS-10-01).

    A travel-time optimizing edge weighting scheme for dynamic re-planning. / Feit, Andrew; Toval, Lenrik; Hovagimian, Raffi; Greenstadt, Rachel.

    Bridging the Gap Between Task and Motion Planning - Papers from the 2010 AAAI Workshop, Technical Report. 2010. p. 26-32 (AAAI Workshop - Technical Report; Vol. WS-10-01).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Feit, A, Toval, L, Hovagimian, R & Greenstadt, R 2010, A travel-time optimizing edge weighting scheme for dynamic re-planning. in Bridging the Gap Between Task and Motion Planning - Papers from the 2010 AAAI Workshop, Technical Report. AAAI Workshop - Technical Report, vol. WS-10-01, pp. 26-32, 2010 AAAI Workshop, Atlanta, GA, United States, 7/11/10.
    Feit A, Toval L, Hovagimian R, Greenstadt R. A travel-time optimizing edge weighting scheme for dynamic re-planning. In Bridging the Gap Between Task and Motion Planning - Papers from the 2010 AAAI Workshop, Technical Report. 2010. p. 26-32. (AAAI Workshop - Technical Report).
    Feit, Andrew ; Toval, Lenrik ; Hovagimian, Raffi ; Greenstadt, Rachel. / A travel-time optimizing edge weighting scheme for dynamic re-planning. Bridging the Gap Between Task and Motion Planning - Papers from the 2010 AAAI Workshop, Technical Report. 2010. pp. 26-32 (AAAI Workshop - Technical Report).
    @inproceedings{b71da5c19ac9419e882eaf4c486ee9e6,
    title = "A travel-time optimizing edge weighting scheme for dynamic re-planning",
    abstract = "The success of autonomous vehicles has made path planning in real, physically grounded environments an increasingly important problem. In environments where speed matters and vehicles must maneuver around obstructions, such as autonomous car navigation in hostile environments, the speed with which real vehicles can traverse a path is often dependent on the sharpness of the corners on the path as well as the length of path edges. We present an algorithm that incorporates the use of the turn angle through path nodes as a limiting factor for vehicle speed. Vehicle speed is then used in a time-weighting calculation for each edge. This allows the path planning algorithm to choose potentially longer paths, with less turns in order to minimize path traversal time. Results simulated in the Breve environment show that travel time can be reduced over the solution obtained using the Anytime D* Algorithm by approximately 10{\%} for a vehicle that is speed limited based on turn rate.",
    author = "Andrew Feit and Lenrik Toval and Raffi Hovagimian and Rachel Greenstadt",
    year = "2010",
    month = "12",
    day = "1",
    language = "English (US)",
    isbn = "9781577354673",
    series = "AAAI Workshop - Technical Report",
    pages = "26--32",
    booktitle = "Bridging the Gap Between Task and Motion Planning - Papers from the 2010 AAAI Workshop, Technical Report",

    }

    TY - GEN

    T1 - A travel-time optimizing edge weighting scheme for dynamic re-planning

    AU - Feit, Andrew

    AU - Toval, Lenrik

    AU - Hovagimian, Raffi

    AU - Greenstadt, Rachel

    PY - 2010/12/1

    Y1 - 2010/12/1

    N2 - The success of autonomous vehicles has made path planning in real, physically grounded environments an increasingly important problem. In environments where speed matters and vehicles must maneuver around obstructions, such as autonomous car navigation in hostile environments, the speed with which real vehicles can traverse a path is often dependent on the sharpness of the corners on the path as well as the length of path edges. We present an algorithm that incorporates the use of the turn angle through path nodes as a limiting factor for vehicle speed. Vehicle speed is then used in a time-weighting calculation for each edge. This allows the path planning algorithm to choose potentially longer paths, with less turns in order to minimize path traversal time. Results simulated in the Breve environment show that travel time can be reduced over the solution obtained using the Anytime D* Algorithm by approximately 10% for a vehicle that is speed limited based on turn rate.

    AB - The success of autonomous vehicles has made path planning in real, physically grounded environments an increasingly important problem. In environments where speed matters and vehicles must maneuver around obstructions, such as autonomous car navigation in hostile environments, the speed with which real vehicles can traverse a path is often dependent on the sharpness of the corners on the path as well as the length of path edges. We present an algorithm that incorporates the use of the turn angle through path nodes as a limiting factor for vehicle speed. Vehicle speed is then used in a time-weighting calculation for each edge. This allows the path planning algorithm to choose potentially longer paths, with less turns in order to minimize path traversal time. Results simulated in the Breve environment show that travel time can be reduced over the solution obtained using the Anytime D* Algorithm by approximately 10% for a vehicle that is speed limited based on turn rate.

    UR - http://www.scopus.com/inward/record.url?scp=79959717816&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=79959717816&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:79959717816

    SN - 9781577354673

    T3 - AAAI Workshop - Technical Report

    SP - 26

    EP - 32

    BT - Bridging the Gap Between Task and Motion Planning - Papers from the 2010 AAAI Workshop, Technical Report

    ER -