Analysing Routes Generated by Planning-based Centralised Traffic Routing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F25%3A00384688" target="_blank" >RIV/68407700:21230/25:00384688 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21730/25:00384688

Výsledek na webu

<a href="https://doi.org/10.32473/flairs.38.1.138872" target="_blank" >https://doi.org/10.32473/flairs.38.1.138872</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.32473/flairs.38.1.138872" target="_blank" >10.32473/flairs.38.1.138872</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Analysing Routes Generated by Planning-based Centralised Traffic Routing

Popis výsledku v původním jazyce

Centralised Traffic Routing offers a global perspective of the entire region, enabling effective route finding for vehicles that navigate through the region. Recently, automated planning techniques were leveraged for centralised traffic routing. However, centralised routing techniques might generate different routes for vehicles even if they share the same origin and destination and arrive at a similar time. Also, centralised routing techniques are usually computationally demanding. In this paper, we analyse the outputs of a planning-based centralised traffic routing method in terms of the number of different routes per journey, differences between traveled distance, and travel time among these (different) routes. Then, we propose a method that leverages the found routes and their relative distribution to vehicles for an online centralised routing.

Název v anglickém jazyce

Analysing Routes Generated by Planning-based Centralised Traffic Routing

Popis výsledku anglicky

Centralised Traffic Routing offers a global perspective of the entire region, enabling effective route finding for vehicles that navigate through the region. Recently, automated planning techniques were leveraged for centralised traffic routing. However, centralised routing techniques might generate different routes for vehicles even if they share the same origin and destination and arrive at a similar time. Also, centralised routing techniques are usually computationally demanding. In this paper, we analyse the outputs of a planning-based centralised traffic routing method in terms of the number of different routes per journey, differences between traveled distance, and travel time among these (different) routes. Then, we propose a method that leverages the found routes and their relative distribution to vehicles for an online centralised routing.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA23-05575S" target="_blank" >GA23-05575S: Řízení dopravy v obydlených oblastech pomocí automatického plánování</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the International Florida Artificial Intelligence Research Society Conference, FLAIRS

ISBN

—

ISSN

2334-0754

e-ISSN

2334-0762

Počet stran výsledku

5

Strana od-do

—

Název nakladatele

LibraryPress@UF

Místo vydání

Florida

Místo konání akce

Daytona Beach, Florida

Datum konání akce

20. 5. 2025

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—