Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 2 of 2
Full-Text Articles in Controls and Control Theory
A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
Electrical & Computer Engineering Faculty Research
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.
On The Empirical Balanced Truncation For Nonlinear Systems, Marissa Condon, Rossen Ivanov
On The Empirical Balanced Truncation For Nonlinear Systems, Marissa Condon, Rossen Ivanov
Articles
Novel constructions of empirical controllability and observability gramians for nonlinear systems for subsequent use in a balanced truncation style of model reduction are proposed. The new gramians are based on a generalisation of the fundamental solution for a Linear Time-Varying system. Relationships between the given gramians for nonlinear systems and the standard gramians for both Linear Time-Invariant and Linear Time-Varying systems are established as well as relationships to prior constructions proposed for empirical gramians. Application of the new gramians is illustrated through a sample test-system.