Text

2TD Path-Planner : Towards a More Realistic Path Planning System over Two-Fold Time-Dependent Road Networks [Application Notes]

Planning driving routes is a common yet challenging task. Previous solutions that often suggest the shortest or time-dependent fastest paths for drivers are incompatible with the diversity of user requirements. Recent years are witnessing an increasing need of utility gained along the driving path and more advanced pathplanners are developed correspondingly, such as the safest and the most beautiful paths. Similar to the travel time on the edge, the utility score actually changes with the time as well. In this paper, targeting a more realistic path planning system, we allow both time cost and utility on the edge to vary from time to time. Over such two-fold time-dependent road network, we aim to discover the optimal driving path for the given user query. To address this NP-hard problem, we propose an approximated algorithm called 2TD Path-Planner, which mainly consists of three components, i.e., edge reachability computing, chromosome encoding, and chromosome decoding.

Ketersediaan

Informasi Detail

Judul Seri

IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE; Vol.16 No.2 May 2021

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 78 - 98

Bahasa

English

ISBN/ISSN

-

Klasifikasi

-

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

DECISION MAKING
ALGORITHMS
PATH PLANNING
ENCODING

Info Detail Spesifik

DOI: 10.1109/MCI.2021.3061879

Pernyataan Tanggungjawab

Chao Chen, Liping Gao, Xuefeng Xie, Liang Feng, Yasha Wang

Versi lain/terkait

Lampiran Berkas

Komentar