Spatial knowledge modelling for agent based system

Efficient simulation of population movement in urban networks is crucial for urban planning, traffic management, and emergency response systems. In this context, we are interested in the shortest path problem in a multi-agent system. In this paper, we present a multi-level model that distinguishes between two levels of granularity: the network reality level and the agent level. For this, we use graphs representing urban networks, with primal modeling, whose edge weights can vary according to the agents and evolve over time. To achieve this, we employed the Customizable Contraction Hierarchies method, which applies multi-phase preprocessing to speed up shortest-path queries and weight updates. Experimental results show that the CCH method significantly improves computational efficiency in shortest path queries.

Authors

Institutions

Publication Details

Journal
Journal of Interdisciplinary Methodologies and Issues in Sciences
Published
2026-10-27
DOI
https://doi.org/10.46298/jimis.15732
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Spatial knowledge modelling for agent based system

Géraldine Del Mondo, Valentin Fouillard, Pierrick Tranouez, Pierre-Marie Stevenin et al.
Journal of Interdisciplinary Methodologies and Issues in Sciences
Data Management and Algorithms
article

Spatial knowledge modelling for agent based system

Géraldine Del Mondo, Valentin Fouillard, Pierrick Tranouez, Pierre-Marie Stevenin, Solene Perret, Raphaël Largeau, Nathan Astegiano
article en

Abstract

Efficient simulation of population movement in urban networks is crucial for urban planning, traffic management, and emergency response systems. In this context, we are interested in the shortest path problem in a multi-agent system. In this paper, we present a multi-level model that distinguishes between two levels of granularity: the network reality level and the agent level. For this, we use graphs representing urban networks, with primal modeling, whose edge weights can vary according to the agents and evolve over time. To achieve this, we employed the Customizable Contraction Hierarchies method, which applies multi-phase preprocessing to speed up shortest-path queries and weight updates. Experimental results show that the CCH method significantly improves computational efficiency in shortest path queries.

Journal of Interdisciplinary Methodologies and Issues in Sciences(Subject Area 3: Graphs and...)
Commissariat à l'Énergie Atomique et aux Énergies Alternatives (FR), Laboratoire d'Intégration des Systèmes et des Technologies (FR), Laboratoire d'Informatique, du Traitement de l'Information et des Systèmes (FR), Living Independently Now Center (US), TechnipFMC (France) (FR), Centre Henri Becquerel (FR)
Sustainable cities and communities
Openalex Percentile: Top 13%
Data Management and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon