Camelia Chira
Papers
4
Total Citations
59
H-Index
2
About
Camelia Chira is a computational intelligence researcher whose work bridges metaheuristic optimization and autonomous robotics, with a particular focus on multi-robot path planning and evolutionary algorithms. Her most influential contribution, "An Efficient Multi-Robot Path Planning Solution Using A* and Coevolutionary Algorithms" (2022, 43 citations), demonstrates her ability to synthesize classical graph-search methods with bio-inspired computation to address real-world challenges in warehouse automation and industrial robotics. This work has established her as a notable voice in the rapidly growing field of robotic navigation and coordination. Her earlier research, including "A Sensitive Metaheuristic for Solving a Large Optimization Problem" (2008), reflects a long-standing commitment to developing adaptive, scalable solutions for complex combinatorial problems. More recently, her investigations into hybrid greedy algorithms and slime mould metaheuristics signal an expanding research agenda that draws inspiration from natural systems to tackle scheduling and path planning at scale. Together, her body of work spans over fifteen years of sustained inquiry into how intelligent algorithms can solve increasingly complex optimization challenges, making her research highly relevant to students and practitioners working at the intersection of artificial intelligence, robotics, and operations research.
Research Focus
Key Achievements
Top Papers
- 1
- 2A Sensitive Metaheuristic for Solving a Large Optimization Problem12 citations · 2008
- 3
- 4Slime Mould Metaheuristic for optimization and robot path planning2 citations · 2025