\n \n \n
\n\n\n
\n
\n\n \n \n \n \n \n \n Estimating Hazardous Locations in Communication-Denied Environments: A Bayesian Network Approach with Path-Based Sensors (Poster).\n \n \n \n \n\n\n \n Srivastava, A. K.; Kontoudis, G. P.; Sofge, D.; and Otte, M.\n\n\n \n\n\n\n In
Maryland Robotics Center (MRC) Research Symposium, College Park, MD, USA, May 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{mrc23-1,\r\n author = {Alkesh K. Srivastava and George P. Kontoudis and Donald Sofge and Michael Otte},\r\n title = {Estimating Hazardous Locations in Communication-Denied Environments: A Bayesian Network Approach with Path-Based Sensors (Poster)},\r\n booktitle = {Maryland Robotics Center (MRC) Research Symposium},\r\n address = {College Park, MD, USA},\r\n year = {2023},\r\n month = {May},\r\n day = {25},\r\n url = {posters/MRC23_1.pdf},\r\n abstract = {This poster presents a Bayesian network approach to estimate hazardous locations in communication-denied environments using path-based sensors. Path-based sensors produce binary observations, indicating whether an event occurred along a path without reporting the precise location of the event. In a lethal communication-denied environment, the proposed approach deploys agents sequentially to infer the location of hazards by observing whether or not the agents survive their journeys along the paths. The approach uses a probabilistic graphical model, specifically a Bayesian network, to formulate a joint distribution among all the random variables in a path, which enables the central entity to compute a more accurate belief update than that used in previous path-based sensor work. Multiple algorithms based on the probabilistic graphical model are proposed and demonstrated to outperform previous information-theoretic planners in similar environments. The study also explores the impact of incorporating additional knowledge about the correlation between hazards and targets on the efficiency of information gathering. To incorporate this knowledge, the study uses a Bayesian network representation of domain knowledge and develops an algorithm based on this representation. The study demonstrates the effectiveness of path-based sensors and Bayesian networks in estimating hazardous locations in communication-denied environments and highlights the potential benefits of incorporating domain knowledge into the planning process.},\r\n}\r\n\r\n
\n
\n\n\n
\n This poster presents a Bayesian network approach to estimate hazardous locations in communication-denied environments using path-based sensors. Path-based sensors produce binary observations, indicating whether an event occurred along a path without reporting the precise location of the event. In a lethal communication-denied environment, the proposed approach deploys agents sequentially to infer the location of hazards by observing whether or not the agents survive their journeys along the paths. The approach uses a probabilistic graphical model, specifically a Bayesian network, to formulate a joint distribution among all the random variables in a path, which enables the central entity to compute a more accurate belief update than that used in previous path-based sensor work. Multiple algorithms based on the probabilistic graphical model are proposed and demonstrated to outperform previous information-theoretic planners in similar environments. The study also explores the impact of incorporating additional knowledge about the correlation between hazards and targets on the efficiency of information gathering. To incorporate this knowledge, the study uses a Bayesian network representation of domain knowledge and develops an algorithm based on this representation. The study demonstrates the effectiveness of path-based sensors and Bayesian networks in estimating hazardous locations in communication-denied environments and highlights the potential benefits of incorporating domain knowledge into the planning process.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Estimating Hazardous Locations in Communication-Denied Environments: Distributed Multi-Robot Approaches with Path-Based Sensors (Poster).\n \n \n \n \n\n\n \n Srivastava, A. K.; Kontoudis, G. P.; Sofge, D.; and Otte, M.\n\n\n \n\n\n\n In
Maryland Robotics Center (MRC) Research Symposium, College Park, MD, USA, May 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{mrc23-2,\r\n author = {Alkesh K. Srivastava and George P. Kontoudis and Donald Sofge and Michael Otte},\r\n title = {Estimating Hazardous Locations in Communication-Denied Environments: Distributed Multi-Robot Approaches with Path-Based Sensors (Poster)},\r\n booktitle = {Maryland Robotics Center (MRC) Research Symposium},\r\n address = {College Park, MD, USA},\r\n year = {2023},\r\n month = {May},\r\n day = {25},\r\n url = {posters/MRC23_2.pdf},\r\n abstract = {Estimating hazardous locations in communication-denied environments is a critical task in various applications. This poster presents three multi-agent information-theoretic planning methods for hazard detection and target localization: Distributed Distributed Entropy Voronoi Partition and Planner (DEVPP), Multi-Agent Distributed Information-Theoretic Planner (MA-DITP), and Multi-Agent Global Information-Theoretic Planner (MA-GITP). DEVPP divides the search space into Voronoi partitions and assigns a robot to each partition, while MA-DITP allows each robot to explore the entire search space. MA-GITP deploys a team of robots simultaneously from the same base station, using expected belief maps to avoid redundant exploration. All methods use sequential Bayesian filtering for updating belief maps, and compute information-theoretic paths based on the expected information gain. The proposed methods are evaluated on simulated search and rescue scenarios, showing promising results in terms of information-gathering efficiency and target localization accuracy.},\r\n}\r\n\r\n
\n
\n\n\n
\n Estimating hazardous locations in communication-denied environments is a critical task in various applications. This poster presents three multi-agent information-theoretic planning methods for hazard detection and target localization: Distributed Distributed Entropy Voronoi Partition and Planner (DEVPP), Multi-Agent Distributed Information-Theoretic Planner (MA-DITP), and Multi-Agent Global Information-Theoretic Planner (MA-GITP). DEVPP divides the search space into Voronoi partitions and assigns a robot to each partition, while MA-DITP allows each robot to explore the entire search space. MA-GITP deploys a team of robots simultaneously from the same base station, using expected belief maps to avoid redundant exploration. All methods use sequential Bayesian filtering for updating belief maps, and compute information-theoretic paths based on the expected information gain. The proposed methods are evaluated on simulated search and rescue scenarios, showing promising results in terms of information-gathering efficiency and target localization accuracy.\n
\n\n\n
\n\n\n\n\n\n