2021
DOI: 10.1080/00207721.2021.1976305
|View full text |Cite
|
Sign up to set email alerts
|

Density-aware decentralised multi-agent exploration with energy constraint based on optimal transport theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 50 publications
0
2
0
Order By: Relevance
“…The optimal control (5) will drive the robot to head toward a location where the highest intensity of gas plume is expected. This optimal control will be calculated in a receding-horizon fashion [8][9][10][11][12][13] with a given horizon length , meaning in each time step, the robot measures the gas plume using an onboard sensor, constructing a function , followed by as shown in (5).…”
Section: Resultsmentioning
confidence: 99%
“…The optimal control (5) will drive the robot to head toward a location where the highest intensity of gas plume is expected. This optimal control will be calculated in a receding-horizon fashion [8][9][10][11][12][13] with a given horizon length , meaning in each time step, the robot measures the gas plume using an onboard sensor, constructing a function , followed by as shown in (5).…”
Section: Resultsmentioning
confidence: 99%
“…Because the costate variable πœ†(𝑑) is unchanging for both J1 and J2, the problem is defined by four equations that provide the optimal path for J1 and J2 which are shown in equations ( 13) through (16). Note that equation ( 13) is the costate variable definition for J1 and equation ( 14) for J2.…”
Section: πœ†(𝑑𝑓)mentioning
confidence: 99%