Aiaa Space 2016 2016
DOI: 10.2514/6.2016-5537
|View full text |Cite
|
Sign up to set email alerts
|

Risk-aware Planning in Hybrid Domains: An Application to Autonomous Planetary Rovers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…Conditional Planning for Autonomy with Risk (CLARK) is a high-level framework for generating task plans under temporal uncertainty. CLARK solves risk-bounded partially observable Markov decision processes (POMDPs) and has been demonstrated in planetary rover exploration problems [23,24]. Internally, this framework employs the p-Sulu [25] and PARIS [26] algorithms for risk-aware path planning and scheduling, respectively.…”
Section: Chance-constrained Optimization For Planetary Explorationmentioning
confidence: 99%
“…Conditional Planning for Autonomy with Risk (CLARK) is a high-level framework for generating task plans under temporal uncertainty. CLARK solves risk-bounded partially observable Markov decision processes (POMDPs) and has been demonstrated in planetary rover exploration problems [23,24]. Internally, this framework employs the p-Sulu [25] and PARIS [26] algorithms for risk-aware path planning and scheduling, respectively.…”
Section: Chance-constrained Optimization For Planetary Explorationmentioning
confidence: 99%
“…In such domains it is important to bound or minimize the probability that an undesirable event occurs, such as reaching a dangerous state or exceeding the capacity of a resource. Problem domains where such constraints occur include the dynamic allocation of radio spectrum while minimizing the risk of collisions (Tehrani et al, 2012), as well as planning autonomous planetary exploration (Santana et al, 2016b). In the conceptualization considered in this survey we can model a chance constraint for a single agent by defining a resource consumption function that equals 1 when the undesirable event occurs, and equals 0 otherwise.…”
Section: Task Allocation Problemsmentioning
confidence: 99%