Daniela Maftuleac
Papers
3
Total Citations
12
H-Index
2
About
Daniela Maftuleac is a researcher whose work lies at the intersection of robotics, distributed algorithms, and computational geometry. Her primary research areas include swarm robotics, autonomous patrolling, and geometric path planning, with a particular focus on developing efficient strategies for multi-agent systems operating under constraints. Her most cited paper, "Local policies for efficiently patrolling a triangulated region by a robot swarm" (2015, 6 citations), introduces a distributed method for surveillance using a swarm of robots with limited capabilities, leveraging a triangulated workspace and stationary sensors to achieve coordinated coverage. This work has been foundational for researchers exploring decentralized control in robotics. Maftuleac has also contributed to theoretical geometry, as seen in her paper "Shortest paths and convex hulls in 2D complexes with non-positive curvature" (2020, 4 citations), which addresses fundamental problems in non-Euclidean spaces. Additionally, her work on "Optimal Distributed Searching in the Plane with and Without Uncertainty" (2016, 2 citations) tackles search strategies under incomplete information. While her citation counts are modest, her research is notable for bridging practical swarm robotics with rigorous geometric theory, offering valuable insights for students and researchers interested in autonomous systems, distributed intelligence, and algorithmic geometry.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3Optimal Distributed Searching in the Plane with and Without Uncertainty2 citations · 2016