Papers
13
Total Citations
102
H-Index
7
About
Ke Cheng is a robotics and multi-agent systems researcher whose work centers on distributed area coverage, swarm robotics, and multi-robot team coordination. His research addresses a fundamental challenge in autonomous systems: how can teams of resource-constrained mobile robots efficiently and cooperatively navigate and cover unknown environments without centralized control? Cheng's most significant contributions lie in applying coalition game theory — particularly weighted voting games — to the formation, coordination, and dynamic reconfiguration of robot teams. His pioneering work on flocking-based coverage strategies demonstrated that mini-robots organized into small, dynamically formed teams could substantially outperform individually operating robots, a finding that has influenced subsequent swarm robotics research. He further advanced the field by developing robust mechanisms for team reformation when robots encounter obstacles, and by integrating reinforcement learning to enable adaptive reconfiguration in changing environments. His research has practical implications for real-world applications including search and rescue operations, aerial surveillance, and autonomous exploration. With his most cited work accumulating 16 citations and a consistent publication record spanning 2008 to 2015, Cheng has built a focused body of work that meaningfully bridges game-theoretic foundations with practical swarm robotics, offering valuable frameworks for students and researchers working on autonomous multi-robot systems.
Research Focus
Key Achievements
Top Papers
- 1Distributed area coverage using robot flocks16 citations · 2009
- 2Robust Multi-robot Team Formations Using Weighted Voting Games13 citations · 2012
- 3Effects of Multi-Robot Team Formations on Distributed Area Coverage11 citations · 2011
- 4
- 5
- 6Dynamic multi-robot team reconfiguration using weighted voting games9 citations · 2015
- 7
- 8
- 9
- 10