Back to Search
Start Over
Balanced-flow algorithm for path network planning in hierarchical spaces.
- Source :
-
Theoretical Computer Science . Jan2020, Vol. 803, p196-206. 11p. - Publication Year :
- 2020
-
Abstract
- Path planning is an important and classical problem in theoretical research and practical applications. In the complex and hierarchical space scenarios, path planning faces more difficulties and challenges due to the structural particularity. Considering the directivity of paths in hierarchical spaces, it is more important to guarantee the fluency and efficiency of the paths in hierarchical spaces. In this paper, we introduce a path network planning problem from multi-source to multi-destination in hierarchical spaces, namely Balanced-Flow Path Network Planning (BF-PNP) problem, and prove its NP-completeness. To balance the flow rate among the layers in the space, we propose a batch scheduling algorithm with the objective of minimizing the scheduling time consumption. To evaluate the performance on efficiency and time complexity, we perform a series of simulations and the results indicate the advantages of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Subjects :
- *SCHEDULING
*ALGORITHMS
*SPACE
*COMPUTER scheduling
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 803
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 140423241
- Full Text :
- https://doi.org/10.1016/j.tcs.2019.10.028