Binh Nguyen, Linh Nguyen, Truong X. Nghiem, Hung La, Jose Baca, Pablo Rangel, Miguel Cid Montoya, Thang Nguyen
{"title":"多机器人系统的时空分布式信息路径规划","authors":"Binh Nguyen, Linh Nguyen, Truong X. Nghiem, Hung La, Jose Baca, Pablo Rangel, Miguel Cid Montoya, Thang Nguyen","doi":"arxiv-2403.16489","DOIUrl":null,"url":null,"abstract":"This paper investigates the problem of informative path planning for a mobile\nrobotic sensor network in spatially temporally distributed mapping. The robots\nare able to gather noisy measurements from an area of interest during their\nmovements to build a Gaussian Process (GP) model of a spatio-temporal field.\nThe model is then utilized to predict the spatio-temporal phenomenon at\ndifferent points of interest. To spatially and temporally navigate the group of\nrobots so that they can optimally acquire maximal information gains while their\nconnectivity is preserved, we propose a novel multistep prediction informative\npath planning optimization strategy employing our newly defined local cost\nfunctions. By using the dual decomposition method, it is feasible and practical\nto effectively solve the optimization problem in a distributed manner. The\nproposed method was validated through synthetic experiments utilizing\nreal-world data sets.","PeriodicalId":501062,"journal":{"name":"arXiv - CS - Systems and Control","volume":"2 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Spatially temporally distributed informative path planning for multi-robot systems\",\"authors\":\"Binh Nguyen, Linh Nguyen, Truong X. Nghiem, Hung La, Jose Baca, Pablo Rangel, Miguel Cid Montoya, Thang Nguyen\",\"doi\":\"arxiv-2403.16489\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates the problem of informative path planning for a mobile\\nrobotic sensor network in spatially temporally distributed mapping. The robots\\nare able to gather noisy measurements from an area of interest during their\\nmovements to build a Gaussian Process (GP) model of a spatio-temporal field.\\nThe model is then utilized to predict the spatio-temporal phenomenon at\\ndifferent points of interest. To spatially and temporally navigate the group of\\nrobots so that they can optimally acquire maximal information gains while their\\nconnectivity is preserved, we propose a novel multistep prediction informative\\npath planning optimization strategy employing our newly defined local cost\\nfunctions. By using the dual decomposition method, it is feasible and practical\\nto effectively solve the optimization problem in a distributed manner. The\\nproposed method was validated through synthetic experiments utilizing\\nreal-world data sets.\",\"PeriodicalId\":501062,\"journal\":{\"name\":\"arXiv - CS - Systems and Control\",\"volume\":\"2 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Systems and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2403.16489\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Systems and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2403.16489","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Spatially temporally distributed informative path planning for multi-robot systems
This paper investigates the problem of informative path planning for a mobile
robotic sensor network in spatially temporally distributed mapping. The robots
are able to gather noisy measurements from an area of interest during their
movements to build a Gaussian Process (GP) model of a spatio-temporal field.
The model is then utilized to predict the spatio-temporal phenomenon at
different points of interest. To spatially and temporally navigate the group of
robots so that they can optimally acquire maximal information gains while their
connectivity is preserved, we propose a novel multistep prediction informative
path planning optimization strategy employing our newly defined local cost
functions. By using the dual decomposition method, it is feasible and practical
to effectively solve the optimization problem in a distributed manner. The
proposed method was validated through synthetic experiments utilizing
real-world data sets.