1 resultado para Time of Arrival Method
em Repository Napier
Filtro por publicador
- Repository Napier (1)
- Aberdeen University (3)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (3)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (9)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (16)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (6)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (8)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (39)
- Brock University, Canada (3)
- Bulgarian Digital Mathematics Library at IMI-BAS (2)
- CaltechTHESIS (2)
- Cambridge University Engineering Department Publications Database (13)
- CentAUR: Central Archive University of Reading - UK (32)
- Center for Jewish History Digital Collections (2)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (72)
- Cochin University of Science & Technology (CUSAT), India (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (3)
- CORA - Cork Open Research Archive - University College Cork - Ireland (4)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (3)
- CUNY Academic Works (2)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (50)
- Department of Computer Science E-Repository - King's College London, Strand, London (5)
- Digital Archives@Colby (2)
- Digital Commons - Michigan Tech (4)
- Digital Commons - Montana Tech (1)
- Digital Commons at Florida International University (6)
- Digital Howard @ Howard University | Howard University Research (1)
- Digital Peer Publishing (1)
- Digital Repository at Iowa State University (2)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (3)
- DigitalCommons@University of Nebraska - Lincoln (1)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (7)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (2)
- Helda - Digital Repository of University of Helsinki (3)
- Indian Institute of Science - Bangalore - Índia (26)
- INSTITUTO DE PESQUISAS ENERGÉTICAS E NUCLEARES (IPEN) - Repositório Digital da Produção Técnico Científica - BibliotecaTerezine Arantes Ferra (1)
- Instituto Politécnico do Porto, Portugal (3)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (10)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- Publishing Network for Geoscientific & Environmental Data (173)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (45)
- Queensland University of Technology - ePrints Archive (42)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (2)
- Repositório do ISCTE - Instituto Universitário de Lisboa (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade Federal de São Paulo - UNIFESP (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (66)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- School of Medicine, Washington University, United States (1)
- Universidad Autónoma de Nuevo León, Mexico (2)
- Universidad de Alicante (4)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (19)
- Universidade Complutense de Madrid (1)
- Universidade Estadual Paulista "Júlio de Mesquita Filho" (UNESP) (1)
- Universidade Federal do Pará (1)
- Universidade Técnica de Lisboa (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Lausanne, Switzerland (5)
- Université de Montréal, Canada (1)
- University of Michigan (165)
- University of Queensland eSpace - Australia (16)
- USA Library of Congress (1)
- WestminsterResearch - UK (3)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.