Page 180 - Innovations in Intelligent Machines
P. 180

172    S. Rathinam and R. Sengupta
                            26. Savla, K., Frazzoli, E., Bullo, F., 2005. On the point-to-point and travel-
                               ing salesperson problems for Dubin’s vehicle. American Control Conference,
                               Portland, Oregan
                            27. Ny, J.L., Feron, E., 2005. An approximation algorithm for the curvature con-
                               strained traveling salesman problem. Proceedings of the 43rd Annual Allerton
                               Conference on Communications, Control and Computing
                            28. Frieze, A., Galbiati, G., Maffioli, F., 1982. On the worst-case performance of
                               some algorithms for the asymmetric traveling salesman problem. Networks 12,
                               pp. 23–39
                            29. Rathinam, S., Sengupta, R., Swaroop, D., 2005. A resource allocation algorithm
                               for multi vehicle systems with non-holonomic constraints. Accepted in IEEE
                               Transactions on Automation Science and Engineering
                            30. Tang, Z., Ozguner, U., 2005. Motion planning for multi-target surveillance with
                               mobile sensor agents. IEEE Transactions of Robotics
                            31. Beard, R., Mclain, T., Goodrich, M., Anderson, E., 2002. Coordinated target
                               assignment and intercept for unmanned air vehicles. IEEE Transactions on
                               Robotics and Automation 18(6), pp. 911–922
                            32. Mclain, T., Beard, R., 2003. Cooperative path planning for timing critical
                               missions. Proceedings of the American Control Conference, Denver, Colorado
                            33. Dubins, L.E., 1957. On curves of minimal length with a constraint on average
                               curvature, and with prescribed initial and terminal positions and tangents.
                               American Journal of Mathematics 79(3), pp. 487–516
                            34. Lagoudakis, M. G., Markakis, E., Kempe, D. , Keskinocak, P., Kleywegt, A.,
                               Koenig, S., Tovey, C., Meyerson, A., and Jain, S., June 2005. Auction-Based
                               Multi-Robot Routing. Proceedings of Robotics: Science and Systems I, Cam-
                               bridge, USA
                            35. Hochbaum, S., July 1996. Approximation Algorithms for NP-Hard Problems
   175   176   177   178   179   180   181   182   183   184   185