Papers

7

Total Citations

472

H-Index

7

About

Ernesto Nunes is a robotics researcher whose work centers on multi-robot systems, task allocation, and scheduling under complex constraints. His most influential contribution is a comprehensive taxonomy for task allocation problems involving temporal and ordering constraints, published in 2016 and cited over 235 times, which has become a foundational reference for researchers navigating the complex landscape of multi-robot coordination challenges. Nunes has made significant strides in developing auction-based algorithms that enable teams of robots to efficiently distribute and execute tasks governed by time windows and precedence constraints. His 2015 work on multi-robot auctions for temporally constrained tasks, cited over 100 times, demonstrated that overlapping time windows could be handled without restrictive assumptions — a meaningful advance for real-world deployment. Subsequent papers extended this framework into decentralized settings, where robots coordinate without central oversight, and introduced iterated auction schemes capable of handling precedence-constrained scheduling. Beyond auction methods, Nunes explored Monte Carlo Tree Search as a satisficing, centralized alternative for task allocation in domains like warehouse automation and surveillance. Across his body of work, he has consistently bridged theoretical rigor with practical robotics applications, establishing himself as a key contributor to the multi-robot task allocation research community.

Research Focus

Key Achievements

7
H-Index
7
Papers
472
Total Citations
67
Avg Citations/Paper
🏆 Most Cited Paper
A taxonomy for task allocation problems with temporal and ordering constraints
235 citations · 2016
📈 Most Prolific Year: 2016 (4 Papers)
🤝 Key Collaborators: 7
🏛 Institutions: University of Minnesota, University of Minnesota System

Top Papers

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 16 days ago