Normalvy
MARC-vy
Risk-averse time-dependent route guidance by constrained dynamic A* search in decentralized system architecture Chen, Yanyan et al
Serie: ; 1944Utgivningsinformation: Transportation research record 1944, 2006Beskrivning: s. 51-7Ämnen: Bibl.nr: VTI P8167:1944Location: Abstrakt: Both the risk of concentration phenomenon for the navigation system and the risk of encountering unacceptable delay are reduced by guiding risk-averse drivers along reliable paths while avoiding high-risk links as far as possible. A constrained dynamic A* algorithm is proposed to search for a reliable path subject to a trip duration constraint in a time-dependent road network. The efficiency of the dynamic A* search is increased by taking advantage of information computed off-line. The algorithms proposed are implemented, and their computational performance is analyzed in simulation.| Omslagsbild | Exemplartyp | Aktuellt bibliotek | Hembibliotek | Avdelning | Hyllplacering | Hyllsignatur | Specificerade material | Volyminfo | URL | Ex.nummer | Status | Kommentarer | Förfallodatum | Streckkod | Exemplarreservationer | Köplats för exemplarreservation | Kurslistor | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Statens väg- och transportforskningsinstitut | Tillgänglig |
Both the risk of concentration phenomenon for the navigation system and the risk of encountering unacceptable delay are reduced by guiding risk-averse drivers along reliable paths while avoiding high-risk links as far as possible. A constrained dynamic A* algorithm is proposed to search for a reliable path subject to a trip duration constraint in a time-dependent road network. The efficiency of the dynamic A* search is increased by taking advantage of information computed off-line. The algorithms proposed are implemented, and their computational performance is analyzed in simulation.