|
Volumn , Issue , 2009, Pages 3955-3960
|
Decomposition algorithm for global reachability analysis on a time-varying graph with an application to planetary exploration
|
Author keywords
Block triangular matrix; Decomposition; Dijkstra's algorithm; Reachability
|
Indexed keywords
ADJACENCY MATRICES;
COMPUTATIONAL ASPECTS;
DECOMPOSITION ALGORITHM;
DIJKSTRA'S ALGORITHMS;
EXPLORATION MISSIONS;
GRAPH SEARCH;
HIGHLY NONLINEAR;
HORIZONTAL WINDS;
HOT AIR;
MEMORY REQUIREMENTS;
PLANETARY EXPLORATION;
PLANNING PROBLEM;
POSSIBLE FUTURES;
PROBLEM SIZE;
REACHABILITY;
REACHABILITY ANALYSIS;
SUB-PROBLEMS;
TIME GRID;
TIME VARYING;
TIME-SCALES;
TRAJECTORY PLANNING;
TRIANGULAR MATRICES;
VEHICLE SYSTEM;
WIND FIELD;
INTELLIGENT ROBOTS;
TIME VARYING SYSTEMS;
INTERPLANETARY SPACECRAFT;
|
EID: 76249086506
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/IROS.2009.5354578 Document Type: Conference Paper |
Times cited : (13)
|
References (12)
|