Optimization of route bundling via differential evolution with a convex representation

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

    6 Citations (Scopus)

    Abstract

    Route bundling implies compounding multiple routes in a way that anchoring points at intermediate locations minimize a global distance metric. The result of route bundling is a tree-like structure where the roots of the tree (anchoring points) serve as coordinating locus for the joint transport of information, goods, and people. Route bundling is a relevant conceptual construct in a number of path planning scenarios where the resources and means of transport are scarce/expensive, or where the environments are inherently hard to navigate due to limited space. In this paper we propose a method for searching optimal route bundles based on a self-adaptive class of differential evolution using a convex representation. Computational experiments in scenarios with and without convex obstacles show the feasibility and efficiency of our approach.

    Original languageEnglish
    Title of host publication2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages727-732
    Number of pages6
    Volume2017-July
    ISBN (Electronic)9781538620342
    DOIs
    Publication statusPublished - 2018 Mar 9
    Event2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017 - Okinawa, Japan
    Duration: 2017 Jul 142017 Jul 18

    Other

    Other2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017
    CountryJapan
    CityOkinawa
    Period17/7/1417/7/18

    Fingerprint

    Differential Evolution
    Motion planning
    Scenarios
    Optimization
    Distance Metric
    Path Planning
    Computational Experiments
    Locus
    Bundle
    Experiments
    Roots
    Minimise
    Imply
    Resources
    Class

    ASJC Scopus subject areas

    • Control and Optimization
    • Artificial Intelligence

    Cite this

    Parque Tenorio, V., Miura, S., & Miyashita, T. (2018). Optimization of route bundling via differential evolution with a convex representation. In 2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017 (Vol. 2017-July, pp. 727-732). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/RCAR.2017.8311950

    Optimization of route bundling via differential evolution with a convex representation. / Parque Tenorio, Victor; Miura, Satoshi; Miyashita, Tomoyuki.

    2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017. Vol. 2017-July Institute of Electrical and Electronics Engineers Inc., 2018. p. 727-732.

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

    Parque Tenorio, V, Miura, S & Miyashita, T 2018, Optimization of route bundling via differential evolution with a convex representation. in 2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017. vol. 2017-July, Institute of Electrical and Electronics Engineers Inc., pp. 727-732, 2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017, Okinawa, Japan, 17/7/14. https://doi.org/10.1109/RCAR.2017.8311950
    Parque Tenorio V, Miura S, Miyashita T. Optimization of route bundling via differential evolution with a convex representation. In 2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017. Vol. 2017-July. Institute of Electrical and Electronics Engineers Inc. 2018. p. 727-732 https://doi.org/10.1109/RCAR.2017.8311950
    Parque Tenorio, Victor ; Miura, Satoshi ; Miyashita, Tomoyuki. / Optimization of route bundling via differential evolution with a convex representation. 2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017. Vol. 2017-July Institute of Electrical and Electronics Engineers Inc., 2018. pp. 727-732
    @inproceedings{bda32fa930c64851b131e41b31e6cfc9,
    title = "Optimization of route bundling via differential evolution with a convex representation",
    abstract = "Route bundling implies compounding multiple routes in a way that anchoring points at intermediate locations minimize a global distance metric. The result of route bundling is a tree-like structure where the roots of the tree (anchoring points) serve as coordinating locus for the joint transport of information, goods, and people. Route bundling is a relevant conceptual construct in a number of path planning scenarios where the resources and means of transport are scarce/expensive, or where the environments are inherently hard to navigate due to limited space. In this paper we propose a method for searching optimal route bundles based on a self-adaptive class of differential evolution using a convex representation. Computational experiments in scenarios with and without convex obstacles show the feasibility and efficiency of our approach.",
    author = "{Parque Tenorio}, Victor and Satoshi Miura and Tomoyuki Miyashita",
    year = "2018",
    month = "3",
    day = "9",
    doi = "10.1109/RCAR.2017.8311950",
    language = "English",
    volume = "2017-July",
    pages = "727--732",
    booktitle = "2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - GEN

    T1 - Optimization of route bundling via differential evolution with a convex representation

    AU - Parque Tenorio, Victor

    AU - Miura, Satoshi

    AU - Miyashita, Tomoyuki

    PY - 2018/3/9

    Y1 - 2018/3/9

    N2 - Route bundling implies compounding multiple routes in a way that anchoring points at intermediate locations minimize a global distance metric. The result of route bundling is a tree-like structure where the roots of the tree (anchoring points) serve as coordinating locus for the joint transport of information, goods, and people. Route bundling is a relevant conceptual construct in a number of path planning scenarios where the resources and means of transport are scarce/expensive, or where the environments are inherently hard to navigate due to limited space. In this paper we propose a method for searching optimal route bundles based on a self-adaptive class of differential evolution using a convex representation. Computational experiments in scenarios with and without convex obstacles show the feasibility and efficiency of our approach.

    AB - Route bundling implies compounding multiple routes in a way that anchoring points at intermediate locations minimize a global distance metric. The result of route bundling is a tree-like structure where the roots of the tree (anchoring points) serve as coordinating locus for the joint transport of information, goods, and people. Route bundling is a relevant conceptual construct in a number of path planning scenarios where the resources and means of transport are scarce/expensive, or where the environments are inherently hard to navigate due to limited space. In this paper we propose a method for searching optimal route bundles based on a self-adaptive class of differential evolution using a convex representation. Computational experiments in scenarios with and without convex obstacles show the feasibility and efficiency of our approach.

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

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

    U2 - 10.1109/RCAR.2017.8311950

    DO - 10.1109/RCAR.2017.8311950

    M3 - Conference contribution

    AN - SCOPUS:85048506874

    VL - 2017-July

    SP - 727

    EP - 732

    BT - 2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -