Ittetsu Taniguchi
Osaka University, Japan
Challenges for online optimization of drone path planning problem
Download SlidesAbstract
Various drone applications are proposed such as delivery, monitoring, security, rescue, etc. To realize drone's automated flight for such applications, path planning is known as an important task for fast and safe flight. Path planning is a problem to put way points to avoid obstacles and high-risk area between origin and destination, and it is known as difficult combinatorial optimization problem. This talk introduces the challenges for online optimization for drone path planning problem to realize adaptive drone flight. Especially, the path planning algorithm and some preliminary results are introduced.
Biography
Ittetsu Taniguchi received B.E., M.E., and Ph.D degrees from Osaka University in 2004, 2006, and 2009, respectively. From 2007 to 2008, he was an international scholar at Katholieke Universiteit Leuven (IMEC), Belgium. In 2009, he joined the College of Science and Engineering, Ritsumeikan University as an assistant professor, and became a lecturer in 2014. In 2017, he joined the Graduate School of Information Science and Technology, Osaka University as an associate professor. His research interests include system level design methodology, and combinatorial optimization problems. He is a member of IEEE, ACM, IEICE, and IPSJ.