Strategic Path Planning by Sequential Parametric Bayesian Decisions
The objective of this research is to generate a path for a mobile agent that carries sensors used for classification, where the path is to optimize strategic objectives that account for misclassification and the consequences of misclassification, and where the weights assigned to these consequences...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2013-11-01
|
Series: | International Journal of Advanced Robotic Systems |
Online Access: | https://doi.org/10.5772/56647 |
id |
doaj-09b38d83845b4362b7c7e4ab5f00dc48 |
---|---|
record_format |
Article |
spelling |
doaj-09b38d83845b4362b7c7e4ab5f00dc482020-11-25T03:45:17ZengSAGE PublishingInternational Journal of Advanced Robotic Systems1729-88142013-11-011010.5772/5664710.5772_56647Strategic Path Planning by Sequential Parametric Bayesian DecisionsBaro Hyun0Pierre Kabamba1Anouck Girard2 Department of Aerospace Engineering, University of Michigan, Ann Arbor, USA Department of Aerospace Engineering, University of Michigan, Ann Arbor, USA Department of Aerospace Engineering, University of Michigan, Ann Arbor, USAThe objective of this research is to generate a path for a mobile agent that carries sensors used for classification, where the path is to optimize strategic objectives that account for misclassification and the consequences of misclassification, and where the weights assigned to these consequences are chosen by a strategist. We propose a model that accounts for the interaction between the agent kinematics (i.e., the ability to move), informatics (i.e., the ability to process data to information), classification (i.e., the ability to classify objects based on the information), and strategy (i.e., the mission objective). Within this model, we pose and solve a sequential decision problem that accounts for strategist preferences and the solution to the problem yields a sequence of kinematic decisions of a moving agent. The solution of the sequential decision problem yields the following flying tactics: “approach only objects whose suspected identity matters to the strategy”. These tactics are numerically illustrated in several scenarios.https://doi.org/10.5772/56647 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Baro Hyun Pierre Kabamba Anouck Girard |
spellingShingle |
Baro Hyun Pierre Kabamba Anouck Girard Strategic Path Planning by Sequential Parametric Bayesian Decisions International Journal of Advanced Robotic Systems |
author_facet |
Baro Hyun Pierre Kabamba Anouck Girard |
author_sort |
Baro Hyun |
title |
Strategic Path Planning by Sequential Parametric Bayesian Decisions |
title_short |
Strategic Path Planning by Sequential Parametric Bayesian Decisions |
title_full |
Strategic Path Planning by Sequential Parametric Bayesian Decisions |
title_fullStr |
Strategic Path Planning by Sequential Parametric Bayesian Decisions |
title_full_unstemmed |
Strategic Path Planning by Sequential Parametric Bayesian Decisions |
title_sort |
strategic path planning by sequential parametric bayesian decisions |
publisher |
SAGE Publishing |
series |
International Journal of Advanced Robotic Systems |
issn |
1729-8814 |
publishDate |
2013-11-01 |
description |
The objective of this research is to generate a path for a mobile agent that carries sensors used for classification, where the path is to optimize strategic objectives that account for misclassification and the consequences of misclassification, and where the weights assigned to these consequences are chosen by a strategist. We propose a model that accounts for the interaction between the agent kinematics (i.e., the ability to move), informatics (i.e., the ability to process data to information), classification (i.e., the ability to classify objects based on the information), and strategy (i.e., the mission objective). Within this model, we pose and solve a sequential decision problem that accounts for strategist preferences and the solution to the problem yields a sequence of kinematic decisions of a moving agent. The solution of the sequential decision problem yields the following flying tactics: “approach only objects whose suspected identity matters to the strategy”. These tactics are numerically illustrated in several scenarios. |
url |
https://doi.org/10.5772/56647 |
work_keys_str_mv |
AT barohyun strategicpathplanningbysequentialparametricbayesiandecisions AT pierrekabamba strategicpathplanningbysequentialparametricbayesiandecisions AT anouckgirard strategicpathplanningbysequentialparametricbayesiandecisions |
_version_ |
1724510393868484608 |