SIAM Student Seminar
Monday, November 27, 2017 - 15:10
1 hour (actually 50 minutes)
School of Mathematics, Georgia Institute of Technology
In this talk, we provide a deterministic algorithm for robotic path finding in unknown environment and an associated graph generator use only potential information. Also we will generalize the algorithm into a path planning algorithm for certain type of optimal control problems under some assumptions and will state some approximation methods if certain assumption no longer holds in some cases. And we hope to prove more theoretical results for those algorithms to guarantee the success.