Name
Abstract | ||
|---|---|---|
This paper exploits the computing power of widely available multi-core machines to accelerate the trajectory planning by parallelisation of the search algorithm. In particular we investigate the approach that schedules the workload on the cores using the hashing function based on the geographical partitioning of the search space. We use this approach to parallelize the AA* algorithm. In our solution, each partition of the geographical space is represented as an agent. The concept is evaluated on the simulation of real-time trajectory planning of aircraft respecting the environment and real aircraft performance models. We show that the approach decreases the planning time significantly on common multi-core machines preserving the quality of the trajectory provided by AA* algorithm. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-28786-2_11 | ADVANCES ON PRACTICAL APPLICATIONS OF AGENTS AND MULTI-AGENT SYSTEMS |
Field | DocType | Volume |
Search algorithm,Computer science,Workload,Algorithm,Exploit,Schedule,Hash function,Partition (number theory),Trajectory,Trajectory planning | Conference | 155 |
ISSN | Citations | PageRank |
1867-5662 | 2 | 0.51 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stepán Kopriva | 1 | 4 | 0.97 |
| David Sislák | 2 | 55 | 9.52 |
| Michal Pěchouček | 3 | 1134 | 133.88 |