Dynamic Navigation Field — a local and on-demand family of algorithms for wayfinding

M. Gilman, H. Moldovan and M. Tencer
Additional contact information
M. Gilman: University of Buenos Aires, Urbix, (CI) FADU
H. Moldovan: University of Buenos Aires, Urbix, (CI) FADU
M. Tencer: University of Buenos Aires, Urbix, (CI) FADU

A chapter in Pedestrian and Evacuation Dynamics 2005, 2007, pp 239-251 from Springer

Abstract: Abstract Simulation of pedestrian navigation in dynamic and complex real environments is a critic and hard problem. In this paper we will introduce a family of case-based reasoning algorithms for wayfinding called Dynamic Navigation Field or DNF that transforms global information into local knowledge according to the requirements of the surrounding environment. In DNF the case memory is composed by a set of navigation fields generated locally and on-demand with efficient storing and retrieval performance.

Keywords: Path Planning; Reactive Layer; Retrieval Performance; Path Planning Problem; Social Force Model (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-47064-9_21

Ordering information: This item can be ordered from
http://www.springer.com/9783540470649

DOI: 10.1007/978-3-540-47064-9_21

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().