Leena Lulu
Papers
5
Total Citations
41
H-Index
4
About
Leena Lulu’s research lies at the intersection of computational geometry and autonomous robotics, with a core focus on robot motion planning in complex, obstacle-filled environments. Her most significant contribution is the development of an art gallery-based approach to global path planning, which adapts the classic art gallery theorem—originally concerned with placing the fewest guards to surveil a polygon—to determine optimal sensor or waypoint placements for mobile robots. This innovative framework, detailed in her most-cited work (2005, 17 citations), provides a robust algorithm for covering workspaces represented as simple polygons with holes. Lulu further validated this approach through comparative performance evaluations against established methods like the visibility-based probabilistic roadmap (2005, 4 citations), demonstrating the efficiency of her art gallery-based roadmap. Beyond algorithmic development, she created a Java-based global path planning system (2004, 9 citations) and a visual educational tool for computer-supported learning (2005, 7 citations), bridging theoretical motion planning with accessible, interactive instruction. Her work on guarding polygons with holes (2005, 4 citations) offers a practical, robust solution for real-world robotic navigation, cementing her impact on both algorithmic theory and applied autonomous systems.
Research Focus
Key Achievements
Top Papers
- 1
- 2A global path planning Java-based system for autonomous mobile robots9 citations · 2004
- 3
- 4
- 5Guarding polygons with holes for robot motion planning applications4 citations · 2005