Document Type

Conference Proceeding

Publication Date

9-2004

Publication Title

Proceedings of the XV International Conference On Systems Science

Publisher

Wrocław University of Technology Publishing House

Volume

15

First page number:

212

Last page number:

218

Abstract

We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.

Keywords

Back propagation (Artificial intelligence); Computer algorithms; Open Shortest Path First (Computer network protocol)

Disciplines

Applied Mathematics | Controls and Control Theory | Electrical and Computer Engineering | Signal Processing | Theory and Algorithms

Language

English

Comments

Conference held September 7 - 10, 2004, Warsaw, Poland

Best copy available

Permissions

Posted with permission of the Wrocław University of Technology, all rights reserved. You may download, display, print and reproduce this material in unaltered form (attaching a copy of this notice) for your personal, non-commercial use. The Wrocław University of Technology reserves the right to revoke such permission at any time.

Download


Share

COinS