Papers
8
Total Citations
72
H-Index
5
About
Bhaskar DasGupta is a researcher whose work bridges robotics, computational geometry, and bioinformatics, with a particular focus on autonomous search and path planning. His most influential contribution is the formalization of "honey-pot constrained searching," a problem where a robot with limited local sensory information must locate a hidden target. In his 2006 paper (35 citations), he modeled this as a reward-collecting path problem and developed efficient approximation algorithms, while his 2004 work (10 citations) explored its computational complexities. DasGupta has also made significant contributions to path planning through harmonic functions, comparing Dirichlet and Neumann boundary conditions to improve robot navigation. His innovative potential field-based domain mapping method (2006, 5 citations) offers a bijective parameterization useful for path planning, shape matching, and morphing. Notably, DasGupta extends his robotics expertise to bioinformatics, modeling RNA loop structures using hyper-redundant robot kinematics (2016, 4 citations)—a creative interdisciplinary approach. His later work addresses practical challenges in cluttered environments, including maximizing safety margins for redundant manipulators (2017) and cooperative motion planning for rovers on uneven terrain (2017). With a career spanning theoretical foundations to applied robotics, DasGupta’s research demonstrates how computational geometry and optimization can solve real-world navigation and design problems.
Research Focus
Key Achievements
Top Papers
- 1Honey-pot constrained searching with local sensory information35 citations · 2006
- 2
- 3
- 4
- 5A novel potential field based domain mapping method5 citations · 2006
- 6Hyper-redundant Robots and bioinformatics: Modelling loops in RNA4 citations · 2016
- 7
- 8