{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/risk-sensitive-rendezvous-algorithm-for","title":"Risk Sensitive Rendezvous Algorithm for Heterogeneous Agents in Urban Environments","arxiv_id":"2002.05749","date":"2020-02-13","proceeding":null,"authors":[],"abstract":"Demand for fast and inexpensive parcel deliveries in urban environments has\nrisen considerably in recent years. A framework is envisioned to enforce\nefficient last mile delivery in urban environments by leveraging a network of\nride-sharing vehicles, where Unmanned Aerial Systems (UASs) drop packages on\nsaid vehicles which then cover the majority of the distance to finally be\npicked up by another UAS for delivery. This approach presents many engineering\nchallenges, including the safe rendezvous of both agents: the UAS and the\nhuman-operated ground vehicle. In this paper, we introduce a framework to\nminimize the risk of failure, while allowing for optimal usage of the\ncontrolled agent. We formulate a compact fast planner to drive a UAS to a\npassive ground vehicle with inexact behavior, while providing intuitive and\nmeaningful procedures to guarantee safety with minimal sacrifice of optimality.\nThe resulting algorithm is shown to be fast and implementable in real-time via\nnumerical tests.","url_abs":"http://arxiv.org/abs/2002.05749v1","url_pdf":"http://arxiv.org/pdf/2002.05749v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"risk-sensitive-rendezvous-algorithm-for","repo_url":"https://github.com/gbarsih/Safe-Optimal-Rendezvous","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}