Abstract
The optimal control of a UAV searching for a target moving, with known constant speed, on a road network and heading toward one of many goal locations is considered. To aid the UAV, some roads in the network are instrumented with unattended ground sensors (UGSs) that detect the target’s motion and record the time it passes by the UGS. When the UAV flies over an UGS location, this time stamped information, if available, is communicated to it. At time 0, the target enters the road network and selects a path leading to one of the exit nodes. The UAV also arrives at the same entry UGS after some delay and is thus informed about the presence of the target in the network. The UAV has no on-board sensing capability and so, capture entails the UAV and target being colocated at an UGS location. If this happens, the UGS is triggered and this information is instantaneously relayed to the UAV, thereby enabling capture. On the other hand, if the target reaches an exit node without being captured, he is deemed to have escaped. We transform the road network, which is restricted to a directed acyclic graph, into a time tree whose node is a tuple comprising the UGS location and evader arrival time at that location. For a given initial delay, we present a recursive forward search method that computes the minimum capture time UAV pursuit policy, under worst-case target action. The recursion scales poorly in the problem parameters, i.e., number of nodes in the time tree and number of evader paths. We present a novel branch and bound technique and a pre-processing step that is experimentally shown to reduce the computational burden by at least two orders of magnitude. We illustrate the applicability of the proposed pruning methods, which result in no loss in optimality, on a realistic example road network.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Başar, T. (2001). Control theory: Twenty-five seminal papers (1932–1981), chap. dual control theory (pp. 181–196). New York: Wiley-IEEE Press.
Borie, R., Tovey, C., & Koenig, S. (2011). Algorithms and complexity results for graph-based pursuit evasion. Autonomous Robots, 31(4), 317. https://doi.org/10.1007/s10514-011-9255-y.
Carlone, L., Axelrod, A., Karaman, S., & Chowdhary, G. (2018). Handbook of dynamic data driven applications systems, chap. aided optimal search: Data-driven target pursuit from on-demand delayed binary observations (pp. 295–335). Cham: Springer.
Chen, H., Krishnamoorthy, K., Zhang, W., & Casbeer, D. (2017). Intruder isolation on a general road network under partial information. IEEE Control Systems Technology, 25(1), 222–234. https://doi.org/10.1109/TCST.2016.2550423.
Chung, T. H., Hollinger, G. A., & Isler, V. (2011). Search and pursuit-evasion in mobile robotics. Autonomous Robots, 31(4), 299–316.
Clarke, N. E. (2009). A witness version of the cops and robber game. Discrete Mathematics, 309(10), 3292–3298.
Clarke, N. E., Cos, D., Duffy, C., Dyer, D., Fitzpatrick, S., & Messinger, M. E. (2017). Limited visibility cops and robbers. arXiv:1708.07179
Demirbas, M., Arora, A., & Gouda, M. (2003). Self-stabilizing systems, lecture notes in computer science, vol. 2704, chap. A pursuer-evader game for sensor networks (pp. 1–16). Berlin: Springer.
Dereniowski, D., Dyer, D., & Tifenbach, R. (2015). Zero-visibility cops and robber and the pathwidth of a graph. Journal of Combinatorial Optimization, 29(3), 541–564.
Dumitrescu, A., Kok, H., Suzuki, I., & Zylinski, P. (2010). Vision-based pursuit-evasion in a grid. SIAM Journal of Discrete Mathematics, 24(3), 1177–1204.
Dzyubenko, G. T., & Pshenichnyi, B. N. (1972). Discrete differential games with information lag. Cybernetics and Systems Analysis, 8(6), 947–952.
Fomin, F. V., & Thilikos, D. M. (2008). An annotated bibliography on guaranteed graph searching. Theoretical Computer Science, 399(3), 236–245.
Isler, V., & Karnad, N. (2008). The role of information in cop-robber game. Theoretical Computer Science, 399(3), 179–190.
Kehagius, A., Mitsche, D., & Pralat, P. (2014). The role of visibility in pursuit/evasion games. arXiv:1402.6136
Krishnamoorthy, K., Casbeer, D., & Pachter, M. (2016a). Pursuit of a moving target with bounded speed on a directed acyclic graph under partial information. IMA Journal of Mathematical Control and Information, 32, 1–16. https://doi.org/10.1093/imamci/dnw061.
Krishnamoorthy, K., Casbeer, D., & Pachter, M. (2016b). Pursuit of a moving target with known constant speed on a directed acyclic graph under partial information. SIAM Journal of Control and Optimization, 54(5), 2259–2273. https://doi.org/10.1137/140994216.
Krishnamoorthy, K., Casbeer, D. W., & Pachter, M. (2015). Minimum time UAV pursuit of a moving ground target using partial information. In International conference on unmanned aircraft systems (ICUAS) (pp. 204–208). Denver, CO.
Krishnamoorthy, K., Darbha, S., Khargonekar, P., Casbeer, D. W., Chandler, P., & Pachter, M. (2013a). Optimal minimax pursuit evasion on a Manhattan grid. In American control conference (pp. 3427–3434). Wasington, DC.
Krishnamoorthy, K., Darbha, S., Khargonekar, P., Chandler, P., & Pachter, M. (2013b). Optimal cooperative pursuit on a Manhattan grid. In AIAA guidance, navigation and control conference, AIAA 2013-4633. Boston, MA
LaValle, S. M. (2006). Planning algorithms, chap. sequential decision theory. Cambridge: Cambridge University Press. http://planning.cs.uiuc.edu/ch10.pdf.
Oh, Y., Choi, S., & Oh, S. (2018). Chance-constrained target tracking using sensors with bounded fan-shaped sensing regions. Autonomous Robots, 42(2), 307–327. https://doi.org/10.1007/s10514-017-9656-7.
Parsons, T. D. (1978). Pursuit-evasion in a graph, lecture notes in mathematics (vol. 642, pp. 426–441). Berlin: Springer.
Rasmussen, S., Krishnamoorthy, K., & Kingston, D. (2016). Field experiment of a fully autonomous multiple UAV/UGS intruder detection and monitoring system. In International conference on unmanned aircraft systems (pp. 1293–1302). Arlington, VA. https://doi.org/10.1109/ICUAS.2016.7502563.
Robin, C., & Lacroix, S. (2016). Multi-robot target detection and tracking: Taxonomy and survey. Autonomous Robots, 40(4), 729–760. https://doi.org/10.1007/s10514-015-9491-7.
Sinopoli, B., Sharp, C., Schenato, L., Schaffert, S., & Sastry, S. (2003). Distributed control applications within sensor networks. Proceedings of the IEEE, 91(8), 1235–1246.
Sugihara, K., & Suzuki, I. (1989). Optimal algorithms for a pursuit-evasion problem in grids. SIAM Journal of Discrete Mathematics, 2(1), 126–143.
Sundaram, S., Krishnamoorthy, K., & Casbeer, D. (2017). Pursuit on a graph under partial information from sensors. In American control conference (pp. 4279–4284). Seattle, WA.
Svec, P., & Gupta, S. K. (2012). Automated synthesis of action selection policies for unmanned vehicles operating in adverse environments. Autonomous Robots, 32(2), 149–164. https://doi.org/10.1007/s10514-011-9268-6.
Vieira, M. A. M., Govindan, R., & Sukhatme, G. S. (2009). Scalable and practical pursuit-evasion with networked robots. Intelligent Service Robotics, 2(4), 247–263.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kalyanam, K., Casbeer, D. & Pachter, M. Graph search of a moving ground target by a UAV aided by ground sensors with local information. Auton Robot 44, 831–843 (2020). https://doi.org/10.1007/s10514-019-09900-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10514-019-09900-0