{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T10:01:38Z","timestamp":1790071298467,"version":"4.0.1"},"reference-count":32,"publisher":"MDPI AG","issue":"18","license":[{"start":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T00:00:00Z","timestamp":1789603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-22-1-2626"],"award-info":[{"award-number":["N00014-22-1-2626"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"award":["N00014-22-1-2626"],"award-info":[{"award-number":["N00014-22-1-2626"]}],"id":[{"id":"https:\/\/ror.org\/00rk2pe57","id-type":"ROR","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Deceptive path planning enables autonomous agents to obscure their true goals from observers by deviating from an expected optimal path. Prior work largely solves full-horizon, end-to-end optimization for single agents, so planning complexity grows with the path length and size of the environment, and adaptation en route requires a new optimization. We propose a unified framework for deceptive path planning onboard the agent, computing over short-horizon candidate paths within a receding-horizon loop. The method processes an agent\u2019s position sensor information and develops a policy for the next trajectory plan. By parameterizing a user-defined cost that captures optimal planning and deception (and optionally includes constraints, trajectory smoothness, and coupling terms between agents), a Boltzmann framework yields stochastic policies that balance the tradeoff between optimal paths and deceptive deviation. Policies are updated locally and do not require learning or training. The level of deception and adherence to constraints can be dynamically tuned, enabling online adaptation to changes in goals and constraints. This step-by-step tuning opens the door to new forms of dynamic deception. In the multi-agent case, we develop a joint planner that is also tunable and can be applied as desired among all or subsets of agents. Single- and multi-agent simulation studies demonstrate the flexibility of our approach, maintaining deception while adapting as desired, avoiding the recomputation required by full-horizon methods, and supporting intuitive tuning via a small set of parameters.<\/jats:p>","DOI":"10.3390\/s26185901","type":"journal-article","created":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T09:04:17Z","timestamp":1790067857000},"page":"5901","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Receding Horizon Multi-Agent Deceptive Path Planner"],"prefix":"10.3390","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2557-3802","authenticated-orcid":false,"given":"Xubin","family":"Fang","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA 18015, USA"}],"role":[{"vocabulary":"crossref","role":"author"},{"role":"conceptualization","vocabulary":"credit"},{"role":"methodology","vocabulary":"credit"},{"role":"software","vocabulary":"credit"},{"role":"validation","vocabulary":"credit"},{"role":"formal-analysis","vocabulary":"credit"},{"role":"investigation","vocabulary":"credit"},{"role":"writing-original-draft","vocabulary":"credit"},{"role":"writing-review-editing","vocabulary":"credit"},{"role":"visualization","vocabulary":"credit"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9564-3812","authenticated-orcid":false,"given":"Brian M.","family":"Sadler","sequence":"additional","affiliation":[{"name":"Oden Institute for Computational Engineering and Sciences, The University of Texas at Austin, Austin, TX 78712, USA"}],"role":[{"vocabulary":"crossref","role":"author"},{"role":"conceptualization","vocabulary":"credit"},{"role":"methodology","vocabulary":"credit"},{"role":"validation","vocabulary":"credit"},{"role":"formal-analysis","vocabulary":"credit"},{"role":"investigation","vocabulary":"credit"},{"role":"writing-review-editing","vocabulary":"credit"},{"role":"supervision","vocabulary":"credit"}]},{"given":"Rick S.","family":"Blum","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA 18015, USA"}],"role":[{"vocabulary":"crossref","role":"author"},{"role":"conceptualization","vocabulary":"credit"},{"role":"investigation","vocabulary":"credit"},{"role":"methodology","vocabulary":"credit"},{"role":"resources","vocabulary":"credit"},{"role":"supervision","vocabulary":"credit"},{"role":"project-administration","vocabulary":"credit"},{"role":"validation","vocabulary":"credit"},{"role":"writing-original-draft","vocabulary":"credit"},{"role":"writing-review-editing","vocabulary":"credit"},{"role":"funding-acquisition","vocabulary":"credit"}]}],"member":"1968","published-online":{"date-parts":[[2026,9,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1109\/TSMCB.2005.848491","article-title":"Toward a systems- and control-oriented agent framework","volume":"35","author":"Fregene","year":"2005","journal-title":"IEEE Trans. Syst. Man. Cybern. Part B"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"8877","DOI":"10.1109\/TSMC.2025.3613395","article-title":"Mission-Driven Trajectory Homotopy to Explore Dynamic Coverage of USV-UAV Systems","volume":"55","author":"Fu","year":"2025","journal-title":"IEEE Trans. Syst. Man. Cybern. Syst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"6696","DOI":"10.1109\/TSMC.2025.3579023","article-title":"A Universal Reactive Approach for Graph-Based Persistent Path Planning Problems With Temporal Logic Constraints","volume":"55","author":"Wang","year":"2025","journal-title":"IEEE Trans. Syst. Man. Cybern. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"4117","DOI":"10.1109\/TSMC.2023.3240023","article-title":"Distributed Search Planning in 3-D Environments With a Dynamically Varying Number of Agents","volume":"53","author":"Papaioannou","year":"2023","journal-title":"IEEE Trans. Syst. Man. Cybern. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3602","DOI":"10.1109\/TSMC.2021.3073105","article-title":"Decentralized Motion Planning for Multiagent Collaboration Under Coupled LTL Task Specifications","volume":"52","author":"Tian","year":"2022","journal-title":"IEEE Trans. Syst. Man. Cybern. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1109\/LRA.2020.2967704","article-title":"Synthesis of a Time-Varying Communication Network by Robot Teams With Information Propagation Guarantees","volume":"5","author":"Yu","year":"2020","journal-title":"IEEE Robot. Autom. Lett."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2636","DOI":"10.1109\/TSMC.2017.2750911","article-title":"A Real-Time and Fully Distributed Approach to Motion Planning for Multirobot Systems","volume":"49","author":"Zhou","year":"2019","journal-title":"IEEE Trans. Syst. Man. Cybern. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Chen, S., Savas, Y., Karabag, M.O., Sadler, B.M., and Topcu, U. (2024, January 8\u201312). Deceptive Planning for Resource Allocation. Proceedings of the 2024 American Control Conference (ACC), Toronto, ON, Canada.","DOI":"10.23919\/ACC60939.2024.10644373"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Fatemi, M.Y., Suttle, W.A., and Sadler, B.M. (2024, January 6\u201310). Deceptive Path Planning via Reinforcement Learning with Graph Neural Networks. Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), Auckland, New Zealand.","DOI":"10.65109\/FMQA6180"},{"key":"ref_10","unstructured":"Savas, Y., Verginis, C.K., and Topcu, U. (March, January 22). Deceptive Decision-Making Under Uncertainty. Proceedings of the AAAI Conference on Artificial Intelligence, Online."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Xu, K., Zeng, Y., Qin, L., and Yin, Q. (2020). Single Real Goal, Magnitude-Based Deceptive Path-Planning. Entropy, 22.","DOI":"10.3390\/e22010088"},{"key":"ref_12","first-page":"58","article-title":"On Almost-Sure Intention Deception Planning that Exploits Imperfect Observers. In Decision and Game Theory for Security (GameSec 2022)","volume":"13727","author":"Fu","year":"2022","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"6108","DOI":"10.1109\/TIV.2024.3362585","article-title":"Optimal Deceptive Strategy Synthesis for Autonomous Systems Under Asymmetric Information","volume":"9","author":"Lv","year":"2024","journal-title":"IEEE Trans. Intell. Veh."},{"key":"ref_14","unstructured":"Price, A., Pereira, R.F., Masters, P., and Vered, M. (June, January 29). Domain-Independent Deceptive Planning. Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, London, UK."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Lenhard, C., Le\u00e3o, T.R.S., Bordini, R.H., and Silva, L.A.L. (2025). The CADETOPATH Framework: Case-Based Deceptive Topographic Path Planning for Computing, Recording, and Reusing Deceptive Path Plans in Agent-Based Simulation Systems. SSRN.","DOI":"10.2139\/ssrn.5276182"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Xu, K., Hu, Y., Zeng, Y., Yin, Q., and Yang, M. (2020). Improving the Scalability of the Magnitude-Based Deceptive Path-Planning Using Subgoal Graphs. Entropy, 22.","DOI":"10.3390\/e22020162"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1109\/TNSE.2025.3584975","article-title":"Efficient Deceptive Path Planning for UAVs via Attention-Based Reinforcement Learning","volume":"13","author":"Xue","year":"2026","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Chen, D., Zeng, Y., Zhang, Y., Li, S., Xu, K., and Yin, Q. (2024). Deceptive Path Planning via Count-Based Reinforcement Learning under Specific Time Constraint. Mathematics, 12.","DOI":"10.3390\/math12131979"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10514-015-9458-8","article-title":"Deceptive Robot Motion: Synthesis, Analysis and Experiments","volume":"39","author":"Dragan","year":"2015","journal-title":"Auton. Robots"},{"key":"ref_20","unstructured":"Root, P.J., De Mot, J., and Feron, E. (2005, January 8\u201310). Randomized Path Planning with Deceptive Strategies. Proceedings of the 2005 American Control Conference (ACC), Portland, OR, USA."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Masters, P., and Sardina, S. (2017, January 19\u201325). Deceptive Path-Planning. Proceedings of the International Joint Conference on Artificial Intelligence Proceedings, Melbourne, VIC, Australia.","DOI":"10.24963\/ijcai.2017\/610"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"111205","DOI":"10.1016\/j.engappai.2025.111205","article-title":"Agent Deception via Polynomial Path Planning","volume":"159","author":"Gutierrez","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_23","unstructured":"Root, P.J. (2005). Collaborative UAV Path Planning with Deceptive Strategies. [Master\u2019s Thesis, Massachusetts Institute of Technology]."},{"key":"ref_24","unstructured":"Sinha, A., Fu, J., Zhu, Q., and Zhang, T. (2024). A Decentralized Shotgun Approach for Team Deception. Decision and Game Theory for Security, Springer."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Suttle, W.A., Milzman, J., Karabag, M.O., Sadler, B.M., and Topcu, U. (2025, January 10\u201312). Value of Information-based Deceptive Path Planning Under Adversarial Interventions. Proceedings of the 2025 IEEE 64th Conference on Decision and Control (CDC), Rio de Janeiro, Brazil.","DOI":"10.1109\/CDC57313.2025.11312876"},{"key":"ref_26","unstructured":"Sutton, R.S., and Barto, A.G. (2018). Reinforcement Learning: An Introduction, MIT Press. [2nd ed.]."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","article-title":"Finite-Time Analysis of the Multiarmed Bandit Problem","volume":"47","author":"Auer","year":"2002","journal-title":"Mach. Learn."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000024","article-title":"Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems","volume":"5","author":"Bubeck","year":"2012","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","article-title":"On the Likelihood that One Unknown Probability Exceeds Another in View of the Evidence of Two Samples","volume":"25","author":"Thompson","year":"1933","journal-title":"Biometrika"},{"key":"ref_30","first-page":"275","article-title":"Weitere Studien \u00fcber das W\u00e4rmegleichgewicht unter Gasmolek\u00fclen","volume":"66","author":"Boltzmann","year":"1872","journal-title":"Sitzungsberichte Kais. Akad. Wiss."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"LaValle, S.M. (2006). Planning Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511546877"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1038\/s44182-026-00083-2","article-title":"Concrete multi-agent path planning enabling kinodynamically aggressive maneuvers","volume":"4","author":"Okumura","year":"2026","journal-title":"npj Robot."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/26\/18\/5901\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T09:10:19Z","timestamp":1790068219000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/26\/18\/5901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,17]]},"references-count":32,"journal-issue":{"issue":"18","published-online":{"date-parts":[[2026,9]]}},"alternative-id":["s26185901"],"URL":"https:\/\/doi.org\/10.3390\/s26185901","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,17]]}}}