2018
DOI: 10.1007/s10514-018-9811-9
|View full text |Cite
|
Sign up to set email alerts
|

Real-time distributed non-myopic task selection for heterogeneous robotic teams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 37 publications
0
6
0
Order By: Relevance
“…In both cases, approaches often do not consider trajectory costs due to kinematic or environmental constraints. Monte Carlo tree search (MCTS) [20] methods can potentially overcome these limitations, enabling nonmyopic planning with respect to complex perception objectives and motion constraints, while providing convergence guarantees [21], [22], [23], [24], [4].…”
Section: Related Workmentioning
confidence: 99%
“…In both cases, approaches often do not consider trajectory costs due to kinematic or environmental constraints. Monte Carlo tree search (MCTS) [20] methods can potentially overcome these limitations, enabling nonmyopic planning with respect to complex perception objectives and motion constraints, while providing convergence guarantees [21], [22], [23], [24], [4].…”
Section: Related Workmentioning
confidence: 99%
“…Omidshafiei et al [7] and Chopra et al [9] have proposed allocation methods that, however, require offline preprocessing of the map with strict spatio-temporal constraints for exploration. Best et al [8] and Smith et al [10] made use of Monte-Carlo Tree Search to incrementally produce exploration tree to share among the agents. The later, however, demands much more computation and exploration time.…”
Section: B Multi-agent Explorationmentioning
confidence: 99%
“…More recent methods employ classical search and planning algorithms to handle the exploration and search allocation tasks in a decentralized manner [7,8,9,10]. However, the distributed versions of the allocation methods in [7,9] still need some offline mapping and evaluation of the environment beforehand.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Decentralized approaches can be further classified into two types: distributed approaches (for e.g. [48,90,91,103,[128][129][130][131]) in which all robots are equivalent with respect to their responsibility to coordinate, and hierarchical approaches which are locally centralized. Distributed coordination requires a distributed MRS, in which the system is composed of robots that are independent to take decisions with respect to each other.…”
Section: Decentralized Coordinationmentioning
confidence: 99%