Autonomous and decentralized mission planning for clusters of UUVs

L. Giovanini, J. Balderud, M.R. Katebi

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

This paper proposes an algorithm for autonomous strategic mission planning of missions where multiple unhabitated underwater vehicles (UUVs) cooperate in order to solve one or more mission tasks. Missions of this type include multi-agent reconnaissance missions and multi-agent mine sweeping missions. The mission planning problem is posed as a receding horizon mixed–integer constrained quadratic optimal control problem. This problem is subsequently partitioned into smaller subproblems and solved in a parallel and decentralized manner using a distributed Nash-based game approach. The paper presents the development of the proposed algorithm and discusses its properties. An application example is used to further demonstrate the main characteristics of the proposed method.
LanguageEnglish
Pages1169-1179
Number of pages11
JournalInternational Journal of Control
Volume80
Issue number7
DOIs
Publication statusPublished - 2007

Fingerprint

Planning

Keywords

  • mission planning
  • uninhabited underwater vehicles
  • reconnaissance
  • mine sweeping

Cite this

Giovanini, L. ; Balderud, J. ; Katebi, M.R. / Autonomous and decentralized mission planning for clusters of UUVs. In: International Journal of Control. 2007 ; Vol. 80, No. 7. pp. 1169-1179.
@article{651fb8e0307d4b4e813772441050fcf8,
title = "Autonomous and decentralized mission planning for clusters of UUVs",
abstract = "This paper proposes an algorithm for autonomous strategic mission planning of missions where multiple unhabitated underwater vehicles (UUVs) cooperate in order to solve one or more mission tasks. Missions of this type include multi-agent reconnaissance missions and multi-agent mine sweeping missions. The mission planning problem is posed as a receding horizon mixed–integer constrained quadratic optimal control problem. This problem is subsequently partitioned into smaller subproblems and solved in a parallel and decentralized manner using a distributed Nash-based game approach. The paper presents the development of the proposed algorithm and discusses its properties. An application example is used to further demonstrate the main characteristics of the proposed method.",
keywords = "mission planning, uninhabited underwater vehicles, reconnaissance, mine sweeping",
author = "L. Giovanini and J. Balderud and M.R. Katebi",
year = "2007",
doi = "10.1080/00207170701253363",
language = "English",
volume = "80",
pages = "1169--1179",
journal = "International Journal of Control",
issn = "0020-7179",
number = "7",

}

Autonomous and decentralized mission planning for clusters of UUVs. / Giovanini, L.; Balderud, J.; Katebi, M.R.

In: International Journal of Control, Vol. 80, No. 7, 2007, p. 1169-1179.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Autonomous and decentralized mission planning for clusters of UUVs

AU - Giovanini, L.

AU - Balderud, J.

AU - Katebi, M.R.

PY - 2007

Y1 - 2007

N2 - This paper proposes an algorithm for autonomous strategic mission planning of missions where multiple unhabitated underwater vehicles (UUVs) cooperate in order to solve one or more mission tasks. Missions of this type include multi-agent reconnaissance missions and multi-agent mine sweeping missions. The mission planning problem is posed as a receding horizon mixed–integer constrained quadratic optimal control problem. This problem is subsequently partitioned into smaller subproblems and solved in a parallel and decentralized manner using a distributed Nash-based game approach. The paper presents the development of the proposed algorithm and discusses its properties. An application example is used to further demonstrate the main characteristics of the proposed method.

AB - This paper proposes an algorithm for autonomous strategic mission planning of missions where multiple unhabitated underwater vehicles (UUVs) cooperate in order to solve one or more mission tasks. Missions of this type include multi-agent reconnaissance missions and multi-agent mine sweeping missions. The mission planning problem is posed as a receding horizon mixed–integer constrained quadratic optimal control problem. This problem is subsequently partitioned into smaller subproblems and solved in a parallel and decentralized manner using a distributed Nash-based game approach. The paper presents the development of the proposed algorithm and discusses its properties. An application example is used to further demonstrate the main characteristics of the proposed method.

KW - mission planning

KW - uninhabited underwater vehicles

KW - reconnaissance

KW - mine sweeping

U2 - 10.1080/00207170701253363

DO - 10.1080/00207170701253363

M3 - Article

VL - 80

SP - 1169

EP - 1179

JO - International Journal of Control

T2 - International Journal of Control

JF - International Journal of Control

SN - 0020-7179

IS - 7

ER -