A Clustering Approach to Path Planning for Groups
| Autor: | Ondřej Kaas, Ivana Kolingerová, Jakub Szkandera |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Computer science
Correlation clustering 020207 software engineering 02 engineering and technology Graph Vertex (geometry) Crowds Approximation error 020204 information systems 0202 electrical engineering electronic engineering information engineering Topological graph theory Graph (abstract data type) Motion planning Cluster analysis Algorithm |
| Zdroj: | Computational Science and Its Applications – ICCSA 2017 ISBN: 9783319623948 ICCSA (2) |
| DOI: | 10.1007/978-3-319-62395-5_32 |
| Popis: | The paper introduces a new method of planning paths for crowds in dynamic environment represented by a graph of vertices and edges, where the edge weight as well as the graph topology may change, but the method is also applicable to environment with a different representation. The utilization of clusterization enables the method to use the computed path for a group of agents. In this way a speed-up and memory savings are achieved at a cost of some path suboptimality. The experiments showed good behaviour of the method as to the speed-up and relative error. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|