Huda Chuangpishit
Papers
6
Total Citations
44
H-Index
4
About
Huda Chuangpishit is a computer scientist whose research sits at the intersection of distributed computing, mobile robotics, and combinatorial optimization. Her work focuses primarily on algorithmic problems involving autonomous robots navigating geometric domains — including evacuation, patrolling, and rendezvous — with particular emphasis on how robots coordinate under constrained communication models. Among her most significant contributions is her pioneering investigation of average-case versus worst-case tradeoffs in robot evacuation problems. Her studies of two robots evacuating a disk under the face-to-face communication model — where robots can only exchange information upon physical meeting — introduced a novel multi-objective optimization framework that has attracted over 16 citations and reshaped how researchers balance competing performance criteria in such settings. Her work on evacuating equilateral triangles extends this geometric thread further. Beyond evacuation, Chuangpishit has contributed to patrolling strategies for point sets with unbalanced visit frequencies and tackled rendezvous problems on infinite lines in the presence of adversarial "spy" robots, demonstrating a keen interest in fault-tolerant distributed algorithms. Her growing citation record across these interconnected topics marks her as an emerging voice in theoretical robotics and distributed computing, offering students a rich foundation in algorithmic analysis under uncertainty.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3
- 4Evacuating an Equilateral Triangle in the Face-to-Face Model4 citations · 2018
- 5
- 6