首页 > 最新文献

Autonomous Robots最新文献

英文 中文
Robust robotic exploration and mapping using generative occupancy map synthesis 基于生成式占用地图合成的鲁棒机器人探索与制图
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-29 DOI: 10.1007/s10514-025-10229-0
Lorin Achey, Alec Reed, Brendan Crowe, Bradley Hayes, Christoffer Heckman

We present a novel approach for enhancing robotic exploration by using generative occupancy mapping. We implement SceneSense, a diffusion model designed and trained for predicting 3D occupancy maps given partial observations. Our proposed approach probabilistically fuses these predictions into a running occupancy map in real-time, resulting in significant improvements in map quality and traversability. We deploy SceneSense on a quadruped robot and validate its performance with real-world experiments to demonstrate the effectiveness of the model. In these experiments we show that occupancy maps enhanced with SceneSense predictions better estimate the distribution of our fully observed ground truth data (24.44% FID improvement around the robot and 75.59% improvement at range). We additionally show that integrating SceneSense enhanced maps into our robotic exploration stack as a “drop-in” map improvement, utilizing an existing off-the-shelf planner, results in improvements in robustness and traversability time. Finally, we show results of full exploration evaluations with our proposed system in two dissimilar environments and find that locally enhanced maps provide more consistent exploration results than maps constructed only from direct sensor measurements.

我们提出了一种新的方法来增强机器人探索使用生成占用映射。我们实现了SceneSense,这是一个扩散模型,设计和训练用于预测给定部分观测的3D占用地图。我们提出的方法概率性地将这些预测融合到实时运行的占用地图中,从而显著提高了地图质量和可穿越性。我们将SceneSense部署在四足机器人上,并通过实际实验验证其性能,以证明该模型的有效性。在这些实验中,我们发现使用SceneSense预测增强的占用地图更好地估计了我们完全观察到的地面真实数据的分布(机器人周围FID提高了24.44%,距离提高了75.59%)。我们还表明,将SceneSense增强地图集成到我们的机器人勘探堆栈中,作为“插入式”地图改进,利用现有的现成规划器,可以提高鲁棒性和可遍历时间。最后,我们展示了在两种不同环境下使用我们提出的系统进行全面勘探评估的结果,并发现局部增强地图比仅由直接传感器测量构建的地图提供更一致的勘探结果。
{"title":"Robust robotic exploration and mapping using generative occupancy map synthesis","authors":"Lorin Achey,&nbsp;Alec Reed,&nbsp;Brendan Crowe,&nbsp;Bradley Hayes,&nbsp;Christoffer Heckman","doi":"10.1007/s10514-025-10229-0","DOIUrl":"10.1007/s10514-025-10229-0","url":null,"abstract":"<div><p>We present a novel approach for enhancing robotic exploration by using generative occupancy mapping. We implement SceneSense, a diffusion model designed and trained for predicting 3D occupancy maps given partial observations. Our proposed approach probabilistically fuses these predictions into a running occupancy map in real-time, resulting in significant improvements in map quality and traversability. We deploy SceneSense on a quadruped robot and validate its performance with real-world experiments to demonstrate the effectiveness of the model. In these experiments we show that occupancy maps enhanced with SceneSense predictions better estimate the distribution of our fully observed ground truth data (24.44% FID improvement around the robot and 75.59% improvement at range). We additionally show that integrating SceneSense enhanced maps into our robotic exploration stack as a “drop-in” map improvement, utilizing an existing off-the-shelf planner, results in improvements in robustness and traversability time. Finally, we show results of full exploration evaluations with our proposed system in two dissimilar environments and find that locally enhanced maps provide more consistent exploration results than maps constructed only from direct sensor measurements.</p></div>","PeriodicalId":55409,"journal":{"name":"Autonomous Robots","volume":"50 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2025-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10514-025-10229-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Decentralized multi-robot exploration under low-bandwidth communications 低带宽通信下的分散多机器人探索
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-29 DOI: 10.1007/s10514-025-10234-3
Jan Bayer, Jan Faigl

In this paper, we address the problem of coordinating multiple robots to explore large-scale underground areas covered with low-bandwidth communication. Based on the evaluation of existing coordination methods, we found that well-performing methods rely on exchanging significant amounts of data, including maps. Such extensive data exchange becomes infeasible using only low-bandwidth communication, which is suitable for underground environments. Therefore, we propose a coordination method that satisfies low-bandwidth constraints by sharing only the robot’s positions. The proposed method employs a fully decentralized principle called Cross-rank that computes how to distribute robots uniformly at intersections and subsequently orders exploration waypoints based on the traveling salesman problem formulation. The proposed principle has been evaluated based on exploration time, traveled distance, and coverage in five large-scale simulated subterranean environments and a real-world deployment with three quadruped robots. The results suggest that the proposed approach provides a suitable tradeoff between the required communication bandwidth and the time needed for exploration.

在本文中,我们解决了协调多个机器人探索低带宽通信覆盖的大规模地下区域的问题。基于对现有协调方法的评估,我们发现表现良好的方法依赖于交换大量的数据,包括地图。这种广泛的数据交换仅使用低带宽通信是不可行的,而低带宽通信适合于地下环境。因此,我们提出了一种仅共享机器人位置以满足低带宽约束的协调方法。该方法采用了一种称为交叉秩的完全分散原理,计算如何在十字路口均匀分布机器人,并根据旅行商问题的公式对探索路径点进行排序。根据5个大型模拟地下环境的勘探时间、行进距离和覆盖范围,以及3个四足机器人的真实部署,对所提出的原理进行了评估。结果表明,所提出的方法在所需的通信带宽和勘探所需的时间之间提供了适当的权衡。
{"title":"Decentralized multi-robot exploration under low-bandwidth communications","authors":"Jan Bayer,&nbsp;Jan Faigl","doi":"10.1007/s10514-025-10234-3","DOIUrl":"10.1007/s10514-025-10234-3","url":null,"abstract":"<div><p>In this paper, we address the problem of coordinating multiple robots to explore large-scale underground areas covered with low-bandwidth communication. Based on the evaluation of existing coordination methods, we found that well-performing methods rely on exchanging significant amounts of data, including maps. Such extensive data exchange becomes infeasible using only low-bandwidth communication, which is suitable for underground environments. Therefore, we propose a coordination method that satisfies low-bandwidth constraints by sharing only the robot’s positions. The proposed method employs a fully decentralized principle called Cross-rank that computes how to distribute robots uniformly at intersections and subsequently orders exploration waypoints based on the traveling salesman problem formulation. The proposed principle has been evaluated based on exploration time, traveled distance, and coverage in five large-scale simulated subterranean environments and a real-world deployment with three quadruped robots. The results suggest that the proposed approach provides a suitable tradeoff between the required communication bandwidth and the time needed for exploration.</p></div>","PeriodicalId":55409,"journal":{"name":"Autonomous Robots","volume":"50 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2025-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10514-025-10234-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Estimating map completeness in robot exploration 机器人探测中地图完备性的估计
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-26 DOI: 10.1007/s10514-025-10221-8
Matteo Luperto, Marco Maria Ferrara, Matteo Princisgh, Giacomo Boracchi, Francesco Amigoni

We present a novel method that, given a grid map of a partially explored indoor environment, estimates the amount of the explored area in the map and whether it is worth continuing to explore the uncovered part of the environment. Our method is based on the idea that modern deep learning models can successfully solve this task by leveraging visual clues in the map. Thus, we train a deep convolutional neural network on images depicting grid maps from partially explored environments, with annotations derived from the knowledge of the entire map, which is not available when the network is used for inference. We show that our network can be used to define a stopping criterion to successfully terminate the exploration process when this is expected to no longer add relevant details about the environment to the map, saving more than 35% of the total exploration time compared to covering the whole environment area.

我们提出了一种新的方法,给定一个部分探索的室内环境的网格地图,估计地图中探索区域的数量以及是否值得继续探索环境中未发现的部分。我们的方法是基于现代深度学习模型可以通过利用地图中的视觉线索成功解决这个任务的想法。因此,我们在描绘部分探索环境的网格地图的图像上训练深度卷积神经网络,并使用来自整个地图知识的注释,这在网络用于推理时是不可用的。我们的研究表明,我们的网络可以用来定义一个停止标准,当期望不再向地图中添加有关环境的相关细节时,成功地终止勘探过程,与覆盖整个环境区域相比,节省了总勘探时间的35%以上。
{"title":"Estimating map completeness in robot exploration","authors":"Matteo Luperto,&nbsp;Marco Maria Ferrara,&nbsp;Matteo Princisgh,&nbsp;Giacomo Boracchi,&nbsp;Francesco Amigoni","doi":"10.1007/s10514-025-10221-8","DOIUrl":"10.1007/s10514-025-10221-8","url":null,"abstract":"<div><p>We present a novel method that, given a grid map of a partially explored indoor environment, estimates the amount of the explored area in the map and whether it is worth continuing to explore the uncovered part of the environment. Our method is based on the idea that modern deep learning models can successfully solve this task by leveraging visual clues in the map. Thus, we train a deep convolutional neural network on images depicting grid maps from partially explored environments, with annotations derived from the knowledge of the entire map, which is not available when the network is used for inference. We show that our network can be used to define a stopping criterion to successfully terminate the exploration process when this is expected to no longer add relevant details about the environment to the map, saving more than 35% of the total exploration time compared to covering the whole environment area.</p></div>","PeriodicalId":55409,"journal":{"name":"Autonomous Robots","volume":"50 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10514-025-10221-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145831337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Planned synchronization for multi-robot systems with active observations 具有主动观测的多机器人系统的计划同步
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-24 DOI: 10.1007/s10514-025-10225-4
Patrick Zhong, Federico Rossi, Dylan A. Shell

An important class of robotic applications involves multiple agents cooperating to provide state observations to plan joint actions. We study planning under uncertainty when more than one participant must proactively plan perception and/or communication acts, and decide whether the cost to obtain a state estimate is justified by the benefits accrued by the information thus obtained. The approach we introduce is suitable for settings where observations are of high quality and they—either alone or along with communication—recover the system’s joint state, but the costs incurred mean this happens only infrequently. We formulate the problem as a type of Markov decision process (mdp) to be solved over macro-actions, sidestepping the construction of the full joint belief space, a well-known source of intractability. We then give a suitable Bellman-like recurrence that immediately suggests a means of solution. In their most general form, policies for these problems simultaneously describe (1) low-level actions to be taken, (2) stages when system-wide state is recovered, and (3) commitments to future rescheduling acts. The formulation expresses multi-agency in a variety of distinct practical forms, including: one party assisting by providing observations of, or reference points for, another; several agents communicating sensor information to fuse data and recover joint state; multiple agents coordinating activities to arrive at states that make joint state simultaneously observable to all individuals. Though solved in centralized form over joint states, the mdp is structured to allow decentralized execution, under some assumptions of synchrony in activities. After providing small-scale simulation studies of the general formulation, we discuss a specific scenario motivated by underwater gliders. We report on a physical robot implementation mocked-up to respect these same constraints, showing that joint plans are found and executed effectively by individual robots after appropriate projection. On the basis of our experience with hardware, we examine enhancements to the model that address nonidealities we have identified in practice, including the assumptions regarding synchrony.

一类重要的机器人应用涉及多个智能体合作提供状态观察以规划联合行动。我们研究了不确定性下的规划,即多个参与者必须主动规划感知和/或沟通行为,并决定获得状态估计的成本是否与由此获得的信息所产生的收益相匹配。我们介绍的方法适用于高质量观测的设置,并且它们(单独或与通信一起)可以恢复系统的联合状态,但是所产生的成本意味着这种情况很少发生。我们将问题表述为一种需要在宏观行为上解决的马尔可夫决策过程(mdp),避开了一个众所周知的难以解决的问题——全联合信念空间的构造。然后,我们给出一个合适的Bellman-like递归式,它立即提出了一种解决方法。在其最一般的形式中,这些问题的策略同时描述(1)要采取的低级行动,(2)系统范围状态恢复的阶段,以及(3)对未来重新调度行为的承诺。这一提法以各种不同的实际形式表达了多机构,包括:一方通过提供对另一方的观察或参考点来协助;多个智能体通信传感器信息,融合数据,恢复关节状态;多个智能体协调活动以达到使所有个体同时观察到联合状态的状态。虽然在联合状态上以集中形式解决,但mdp的结构允许在活动同步的某些假设下分散执行。在提供一般公式的小规模模拟研究之后,我们讨论了由水下滑翔机驱动的特定场景。我们报告了一个物理机器人的实现模型,以尊重这些相同的约束,表明在适当的投影后,单个机器人可以发现并有效地执行联合计划。根据我们在硬件方面的经验,我们研究了对模型的增强,以解决我们在实践中发现的非理想性,包括关于同步的假设。
{"title":"Planned synchronization for multi-robot systems with active observations","authors":"Patrick Zhong,&nbsp;Federico Rossi,&nbsp;Dylan A. Shell","doi":"10.1007/s10514-025-10225-4","DOIUrl":"10.1007/s10514-025-10225-4","url":null,"abstract":"<div><p>An important class of robotic applications involves multiple agents cooperating to provide state observations to plan joint actions. We study planning under uncertainty when more than one participant must proactively plan perception and/or communication acts, and decide whether the cost to obtain a state estimate is justified by the benefits accrued by the information thus obtained. The approach we introduce is suitable for settings where observations are of high quality and they—either alone or along with communication—recover the system’s joint state, but the costs incurred mean this happens only infrequently. We formulate the problem as a type of Markov decision process (<span>mdp</span>) to be solved over macro-actions, sidestepping the construction of the full joint belief space, a well-known source of intractability. We then give a suitable Bellman-like recurrence that immediately suggests a means of solution. In their most general form, policies for these problems simultaneously describe (1) low-level actions to be taken, (2) stages when system-wide state is recovered, and (3) commitments to future rescheduling acts. The formulation expresses multi-agency in a variety of distinct practical forms, including: one party assisting by providing observations of, or reference points for, another; several agents communicating sensor information to fuse data and recover joint state; multiple agents coordinating activities to arrive at states that make joint state simultaneously observable to all individuals. Though solved in centralized form over joint states, the <span>mdp</span> is structured to allow decentralized execution, under some assumptions of synchrony in activities. After providing small-scale simulation studies of the general formulation, we discuss a specific scenario motivated by underwater gliders. We report on a physical robot implementation mocked-up to respect these same constraints, showing that joint plans are found and executed effectively by individual robots after appropriate projection. On the basis of our experience with hardware, we examine enhancements to the model that address nonidealities we have identified in practice, including the assumptions regarding synchrony.</p></div>","PeriodicalId":55409,"journal":{"name":"Autonomous Robots","volume":"50 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2025-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10514-025-10225-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145831467","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A tree-based exploration method: utilizing the topology of the map as the basis of goal selection 一种基于树的勘探方法:利用地图的拓扑结构作为目标选择的基础
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-12-02 DOI: 10.1007/s10514-025-10223-6
Barbara Abonyi-Tóth, Ákos Nagy

In this paper, we present a novel method for autonomous robotic exploration using a car-like robot. The proposed method uses the frontiers in the map to build a tree representing the structure of the environment to aid the goal-selection method. An augmentation of the method is also proposed which is able to manage the loops present in the environment. In this case, the environment is represented with a graph structure. We compared the two proposed methods with seven state-of-the-art exploration methods in three simulated environments. The experiments show, that the proposed methods outperform the existing methods both in the time taken until full exploration and the distance traveled during the exploration, while offering a robust solution for autonomous robotic exploration without the need to tune several parameters to the unknown environment. The proposed exploration method was also tested using a real-life robot in an office scenario.

本文提出了一种利用类车机器人进行自主探索的新方法。该方法利用地图中的边界构建代表环境结构的树来辅助目标选择方法。本文还提出了一种改进的方法,能够管理环境中存在的循环。在这种情况下,环境用图结构表示。我们将这两种方法与七种最先进的勘探方法在三个模拟环境中进行了比较。实验表明,该方法在完全探测所需的时间和探测过程中的距离上都优于现有方法,同时为机器人自主探测提供了一个鲁棒的解决方案,而无需对未知环境调整多个参数。提出的探索方法还在办公室场景中使用现实生活中的机器人进行了测试。
{"title":"A tree-based exploration method: utilizing the topology of the map as the basis of goal selection","authors":"Barbara Abonyi-Tóth,&nbsp;Ákos Nagy","doi":"10.1007/s10514-025-10223-6","DOIUrl":"10.1007/s10514-025-10223-6","url":null,"abstract":"<div><p>In this paper, we present a novel method for autonomous robotic exploration using a car-like robot. The proposed method uses the frontiers in the map to build a tree representing the structure of the environment to aid the goal-selection method. An augmentation of the method is also proposed which is able to manage the loops present in the environment. In this case, the environment is represented with a graph structure. We compared the two proposed methods with seven state-of-the-art exploration methods in three simulated environments. The experiments show, that the proposed methods outperform the existing methods both in the time taken until full exploration and the distance traveled during the exploration, while offering a robust solution for autonomous robotic exploration without the need to tune several parameters to the unknown environment. The proposed exploration method was also tested using a real-life robot in an office scenario.</p></div>","PeriodicalId":55409,"journal":{"name":"Autonomous Robots","volume":"50 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2025-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145675500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-object active search and tracking by multiple agents in untrusted, dynamically changing environments 在不可信的、动态变化的环境中由多个代理进行多目标主动搜索和跟踪
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-11-28 DOI: 10.1007/s10514-025-10218-3
Mingi Jeong, Cristian Molinaro, Tonmoay Deb, Youzhi Zhang, Andrea Pugliese, Eugene Santos Jr., V. S. Subrahmanian, Alberto Quattrini Li

This paper addresses the problem of both actively searching and tracking multiple unknown dynamic objects in a known environment with multiple cooperative autonomous agents with partial observability. The tracking of a target ends when the uncertainty is below a specified threshold. Current methods typically assume homogeneous agents without access to external information and utilize short-horizon target predictive models. Such assumptions limit real-world applications. We propose a fully integrated pipeline where the main novel contributions are: (1) a time-varying weighted belief representation capable of handling knowledge that changes over time, which includes external reports of varying levels of trustworthiness in addition to the agents involved; (2) the integration of a Long Short Term Memory-based trajectory prediction within the optimization framework for long-horizon decision-making, which accounts for trajectory prediction in time-configuration space, thus increasing responsiveness; and (3) a comprehensive system that accounts for multiple agents and enables information-driven optimization during both the search and track tasks. When communication is available, our proposed strategy consolidates exploration results collected asynchronously by agents and external sources into a headquarters, who can allocate each agent to maximize the overall team’s utility, effectively using all available information. We tested our approach extensively in Monte Carlo simulations against baselines, representative of classes of approaches from the literature, and in robustness and ablation studies. In addition, we performed experiments in a 3D physics based engine robot simulator to test the applicability in the real world, as well as with real-world trajectories obtained from an oceanography computational fluid dynamics simulator. Results show the effectiveness of our proposed method, which achieves mission completion times that are 1.3 to 3.2 times faster in finding all targets, in most scenarios, including challenging ones, where the number of targets is 5 times greater than that of the agents.

本文研究了在已知环境下,利用具有部分可观察性的多个协作自治智能体主动搜索和跟踪多个未知动态目标的问题。当不确定性低于指定阈值时,对目标的跟踪结束。目前的方法通常假设同质代理不访问外部信息,并利用短期目标预测模型。这样的假设限制了实际应用。我们提出了一个完全集成的管道,其中主要的新颖贡献是:(1)能够处理随时间变化的知识的时变加权信念表示,其中包括除了所涉及的代理之外的不同可信度水平的外部报告;(2)将基于长短期记忆的轨迹预测整合到长期决策优化框架中,兼顾了时间配置空间的轨迹预测,提高了响应能力;(3)一个综合系统,该系统考虑多个代理,并在搜索和跟踪任务期间实现信息驱动的优化。当通信可用时,我们提出的策略将由代理和外部资源异步收集的探索结果合并到总部,总部可以分配每个代理以最大化整个团队的效用,有效地利用所有可用信息。我们在针对基线的蒙特卡罗模拟中广泛测试了我们的方法,代表了文献中的方法类别,并在鲁棒性和消融研究中进行了测试。此外,我们在基于3D物理的发动机机器人模拟器中进行了实验,以测试其在现实世界中的适用性,以及从海洋学计算流体动力学模拟器中获得的真实轨迹。结果表明,在大多数情况下,包括具有挑战性的情况下,我们提出的方法在寻找所有目标时的任务完成时间要快1.3到3.2倍,其中目标数量是agent数量的5倍。
{"title":"Multi-object active search and tracking by multiple agents in untrusted, dynamically changing environments","authors":"Mingi Jeong,&nbsp;Cristian Molinaro,&nbsp;Tonmoay Deb,&nbsp;Youzhi Zhang,&nbsp;Andrea Pugliese,&nbsp;Eugene Santos Jr.,&nbsp;V. S. Subrahmanian,&nbsp;Alberto Quattrini Li","doi":"10.1007/s10514-025-10218-3","DOIUrl":"10.1007/s10514-025-10218-3","url":null,"abstract":"<div><p>This paper addresses the problem of both actively searching and tracking multiple unknown dynamic objects in a known environment with multiple cooperative autonomous agents with partial observability. The tracking of a target ends when the uncertainty is below a specified threshold. Current methods typically assume homogeneous agents without access to external information and utilize short-horizon target predictive models. Such assumptions limit real-world applications. We propose a fully integrated pipeline where the main novel contributions are: (1) a time-varying weighted belief representation capable of handling knowledge that changes over time, which includes external reports of varying levels of trustworthiness in addition to the agents involved; (2) the integration of a Long Short Term Memory-based trajectory prediction within the optimization framework for long-horizon decision-making, which accounts for trajectory prediction in time-configuration space, thus increasing responsiveness; and (3) a comprehensive system that accounts for multiple agents and enables information-driven optimization during both the search and track tasks. When communication is available, our proposed strategy consolidates exploration results collected asynchronously by agents and external sources into a headquarters, who can allocate each agent to maximize the overall team’s utility, effectively using all available information. We tested our approach extensively in Monte Carlo simulations against baselines, representative of classes of approaches from the literature, and in robustness and ablation studies. In addition, we performed experiments in a 3D physics based engine robot simulator to test the applicability in the real world, as well as with real-world trajectories obtained from an oceanography computational fluid dynamics simulator. Results show the effectiveness of our proposed method, which achieves mission completion times that are 1.3 to 3.2 times faster in finding all targets, in most scenarios, including challenging ones, where the number of targets is 5 times greater than that of the agents.</p></div>","PeriodicalId":55409,"journal":{"name":"Autonomous Robots","volume":"50 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2025-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145612909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Robot-relay: building-wide, calibration-less visual servoing with learned sensor handover networks 机器人中继:具有学习传感器切换网络的建筑物范围内,无需校准的视觉伺服
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-11-28 DOI: 10.1007/s10514-025-10227-2
Luke Robinson, Matthew Gadd, Paul Newman, Daniele De Martini

This paper proposes a novel system to conduct visual servoing of a mobile robot using multiple uncalibrated, wall-mounted cameras. Specifically, we utilise a constellation of such sensors to cover a wide area by allowing robot control to be passed between cameras in regions where their fields of view overlap. This method, in conjunction with the fact that all computing is also executed offboard, allows for simpler and cheaper robots to be deployed in controlled and finite spaces. Our method simplifies the natural installation cycle of a newly deployed camera network, eliminating the need for explicit camera positioning or orientation, both globally (relative to a building plan) and locally (among viewpoints). Our system memorises pixel-wise topological connections between viewpoints by leveraging natural human exploration of the environment. We detect graph edges through simultaneous detections of the same person across different cameras, allowing us to automatically construct an evolving graph that represents overlapping fields of view within the camera network. In combination with a hybrid-A*-based planner, our approach allows efficient planning and control of robots across a wide area by traversing cameras between areas of overlap. We validate our approach through autonomous traversals in a productive office environment, using a network of six cameras, and compare our performance against both human teleoperation and a traditional Simultaneous Localisation and Mapping (SLAM) approach.

本文提出了一种使用多个未校准的壁挂式摄像机对移动机器人进行视觉伺服的新系统。具体来说,我们利用一个这样的传感器星座,通过允许机器人在它们的视野重叠的区域之间在相机之间传递控制,来覆盖广泛的区域。这种方法,再加上所有的计算都可以在船上执行,使得更简单、更便宜的机器人可以部署在受控制的有限空间中。我们的方法简化了新部署摄像机网络的自然安装周期,消除了明确的摄像机定位或方向的需要,无论是全局(相对于建筑平面)还是局部(在视点之间)。我们的系统通过利用人类对环境的自然探索来记忆视点之间的像素级拓扑连接。我们通过在不同摄像机上同时检测同一个人来检测图的边缘,使我们能够自动构建一个表示摄像机网络中重叠视场的进化图。结合基于hybrid-A*的规划器,我们的方法可以通过在重叠区域之间遍历摄像头来实现机器人在大范围内的有效规划和控制。我们通过在高效的办公环境中自主遍历验证我们的方法,使用六个摄像头的网络,并将我们的性能与人类远程操作和传统的同步定位和映射(SLAM)方法进行比较。
{"title":"Robot-relay: building-wide, calibration-less visual servoing with learned sensor handover networks","authors":"Luke Robinson,&nbsp;Matthew Gadd,&nbsp;Paul Newman,&nbsp;Daniele De Martini","doi":"10.1007/s10514-025-10227-2","DOIUrl":"10.1007/s10514-025-10227-2","url":null,"abstract":"<div><p>This paper proposes a novel system to conduct visual servoing of a mobile robot using multiple uncalibrated, wall-mounted cameras. Specifically, we utilise a constellation of such sensors to cover a wide area by allowing robot control to be passed between cameras in regions where their fields of view overlap. This method, in conjunction with the fact that all computing is also executed offboard, allows for simpler and cheaper robots to be deployed in controlled and finite spaces. Our method simplifies the natural installation cycle of a newly deployed camera network, eliminating the need for explicit camera positioning or orientation, both globally (relative to a building plan) and locally (among viewpoints). Our system memorises pixel-wise topological connections between viewpoints by leveraging natural human exploration of the environment. We detect graph edges through simultaneous detections of the same person across different cameras, allowing us to automatically construct an evolving graph that represents overlapping fields of view within the camera network. In combination with a hybrid-A*-based planner, our approach allows efficient planning and control of robots across a wide area by traversing cameras between areas of overlap. We validate our approach through autonomous traversals in a productive office environment, using a network of six cameras, and compare our performance against both human teleoperation and a traditional Simultaneous Localisation and Mapping (SLAM) approach.</p></div>","PeriodicalId":55409,"journal":{"name":"Autonomous Robots","volume":"50 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2025-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10514-025-10227-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145612907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Probabilistic multi-robot planning with temporal tasks and communication constraints 具有时间任务和通信约束的概率多机器人规划
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-11-28 DOI: 10.1007/s10514-025-10231-6
Thales C. Silva, Xi Yu, M. Ani Hsieh

Multi-robot systems are broadly used in applications such as search and rescue, environmental monitoring, and mapping of unknown environments. Effective coordination among these robots often relies on distributed information and local decision-making. However, maintaining constant communication links between robots can be challenging due to environmental and task constraints. Robots can move around to seek temporal communication links that over time jointly establish the intermittent connectivity of the network. This paper aims to incorporate temporal communication constraints into the path planning for multi-robot teams with stochastic motion and handling complex tasks specified in a temporal order. We use formal methods to model the temporal specification of tasks. Task assignments and high-level communication requirements are provided to individual robots on a multi-robot team as independent temporal logic expressions. Robots update their plans for future communication events according to their local decision-making algorithms and jointly synthesize a bottom-up policy to meet the communication requirements. We provide a strategy to maintain intermittent connectivity while satisfying a risk constraint. In addition, we systematically analyze the impact of different rendezvous selection strategies, comparing cost functions that minimize the total traveled distance, balance distances among robots, or incorporate risk awareness. Our simulation results suggest that the proposed method effectively accommodates diverse operational preferences, enhancing flexibility, robustness, and overall mission performance.

多机器人系统广泛应用于搜救、环境监测、未知环境测绘等领域。这些机器人之间的有效协调往往依赖于分布式信息和局部决策。然而,由于环境和任务的限制,在机器人之间保持持续的通信联系可能是具有挑战性的。机器人可以四处移动,寻找暂时的通信链路,随着时间的推移,这些通信链路共同建立了网络的间歇性连接。本文旨在将时间通信约束纳入具有随机运动的多机器人团队的路径规划中,并处理以时间顺序指定的复杂任务。我们使用形式化方法对任务的时间规范进行建模。任务分配和高级通信需求作为独立的时序逻辑表达式提供给多机器人团队中的单个机器人。机器人根据自身的局部决策算法更新对未来通信事件的计划,并共同合成自下而上的策略以满足通信需求。我们提供了一种策略,在满足风险约束的同时保持间歇性连接。此外,我们系统地分析了不同交会选择策略的影响,比较了最小化总行程距离、平衡机器人之间的距离或纳入风险意识的成本函数。我们的仿真结果表明,所提出的方法有效地适应了不同的作战偏好,增强了灵活性、鲁棒性和整体任务性能。
{"title":"Probabilistic multi-robot planning with temporal tasks and communication constraints","authors":"Thales C. Silva,&nbsp;Xi Yu,&nbsp;M. Ani Hsieh","doi":"10.1007/s10514-025-10231-6","DOIUrl":"10.1007/s10514-025-10231-6","url":null,"abstract":"<div><p>Multi-robot systems are broadly used in applications such as search and rescue, environmental monitoring, and mapping of unknown environments. Effective coordination among these robots often relies on distributed information and local decision-making. However, maintaining constant communication links between robots can be challenging due to environmental and task constraints. Robots can move around to seek temporal communication links that over time jointly establish the intermittent connectivity of the network. This paper aims to incorporate temporal communication constraints into the path planning for multi-robot teams with stochastic motion and handling complex tasks specified in a temporal order. We use formal methods to model the temporal specification of tasks. Task assignments and high-level communication requirements are provided to individual robots on a multi-robot team as independent temporal logic expressions. Robots update their plans for future communication events according to their local decision-making algorithms and jointly synthesize a bottom-up policy to meet the communication requirements. We provide a strategy to maintain intermittent connectivity while satisfying a risk constraint. In addition, we systematically analyze the impact of different rendezvous selection strategies, comparing cost functions that minimize the total traveled distance, balance distances among robots, or incorporate risk awareness. Our simulation results suggest that the proposed method effectively accommodates diverse operational preferences, enhancing flexibility, robustness, and overall mission performance.</p></div>","PeriodicalId":55409,"journal":{"name":"Autonomous Robots","volume":"50 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2025-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145612910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed spatial awareness for robot swarms 机器人群的分布式空间感知
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-11-22 DOI: 10.1007/s10514-025-10228-1
Simon Jones, Sabine Hauert

Building a distributed spatial awareness within a swarm of locally sensing and communicating robots enables new swarm algorithms. We use local observations by robots of each other and Gaussian belief propagation message passing combined with continuous swarm movement to build a global and distributed swarm-centric frame of reference. With low bandwidth and computation requirements, this shared reference frame allows new swarm algorithms. We characterise the system in simulation and demonstrate two example algorithms, then demonstrate reliable performance on real robots with imperfect sensing.

在一群局部感知和通信的机器人中建立分布式空间感知可以实现新的群体算法。我们使用机器人彼此的局部观测和高斯信念传播消息传递结合连续的群体运动来构建一个全局和分布式的以群体为中心的参考框架。由于低带宽和计算需求,这种共享参考框架允许新的群算法。我们在仿真中对系统进行了表征,并演示了两个示例算法,然后在具有不完美传感的真实机器人上演示了可靠的性能。
{"title":"Distributed spatial awareness for robot swarms","authors":"Simon Jones,&nbsp;Sabine Hauert","doi":"10.1007/s10514-025-10228-1","DOIUrl":"10.1007/s10514-025-10228-1","url":null,"abstract":"<div><p>Building a distributed spatial awareness within a swarm of locally sensing and communicating robots enables new swarm algorithms. We use local observations by robots of each other and Gaussian belief propagation message passing combined with continuous swarm movement to build a global and distributed swarm-centric frame of reference. With low bandwidth and computation requirements, this shared reference frame allows new swarm algorithms. We characterise the system in simulation and demonstrate two example algorithms, then demonstrate reliable performance on real robots with imperfect sensing.</p></div>","PeriodicalId":55409,"journal":{"name":"Autonomous Robots","volume":"49 4","pages":""},"PeriodicalIF":4.3,"publicationDate":"2025-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10514-025-10228-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145561537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Human-drone collaboration via mixed-reality for efficient navigation and interaction in constrained environments: a comprehensive user case study 在受限环境中,通过混合现实实现高效导航和交互的人机协作:一个全面的用户案例研究
IF 4.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-11-21 DOI: 10.1007/s10514-025-10222-7
Luca Morando, Xingyuan Zhou, Farokh Atashzar, Giuseppe Loianno

Aerial Robots have the potential to play a crucial role in assisting humans in complex and dangerous tasks with the goal to decrease users’ cognitive and physical workload. In addition, many applications will require aerial robots to be ubiquitous and share the same environment with human operators. Therefore, this calls for novel solutions to enable seamless, transparent, and efficient human-drone collaboration and co-working in the same workspace. In this paper, we present a novel tele-immersive approach that promotes cognitive and physical collaboration between humans and robots through Mixed Reality (MR). We develop a bi-directional spatial awareness module and a new virtual-physical interaction approach integrated on a head-mounted display with MR. Furthermore, we design two alternative methods for spatial and physical interaction. Both solutions use a 2D monitor for spatial representation, with one method involving a mouse and keyboard, and the other using a haptic interface with the new VAC solution for physical interaction. This setup allows us to study how to analyze how different physical embodiments might compensate for reduced spatial representation during interaction tasks. Finally, to validate our approach and our comparative study, we propose a comprehensive user case study where 12 subjects with different expertise and background are tasked to complete a target reaching task in an indoor cluttered environment. We consider as part of the evaluation both subjective metrics, such as the System Usability Scale and the NASA Task Load Index, as well as objective measures, including completion time, distance traveled to reach the goal, and smoothness of movements. The results demonstrate enhanced user interaction and control capabilities during the task when using our novel novel tele-immersive approach with MR compared to the two alternative solutions. Additionally, the experiments show the opportunity to employ the proposed system as a new innovative collaboration approach between a non-expert human and an aerial robot for exploration and inspection tasks in unknown environments. Video: https://youtu.be/q8Dq-cNxcig

空中机器人在帮助人类完成复杂和危险的任务方面发挥着至关重要的作用,其目标是减少用户的认知和身体工作量。此外,许多应用将要求空中机器人无处不在,并与人类操作员共享相同的环境。因此,这需要新颖的解决方案来实现无缝、透明和高效的人机协作,并在同一工作空间内共同工作。在本文中,我们提出了一种新颖的远程沉浸式方法,通过混合现实(MR)促进人类和机器人之间的认知和物理协作。我们开发了一种双向空间感知模块和一种新的虚拟物理交互方法,该方法集成在带有mr的头戴式显示器上。此外,我们还设计了两种可供选择的空间和物理交互方法。两种解决方案都使用2D显示器进行空间表示,其中一种方法涉及鼠标和键盘,另一种方法使用带有新VAC解决方案的触觉界面进行物理交互。这种设置使我们能够研究如何分析不同的物理实施例如何在交互任务中补偿减少的空间表征。最后,为了验证我们的方法和我们的比较研究,我们提出了一个全面的用户案例研究,其中12名具有不同专业知识和背景的受试者被要求在室内杂乱的环境中完成目标到达任务。我们将主观指标,如系统可用性量表和NASA任务负载指数,以及客观指标,包括完成时间、到达目标的距离和运动的平稳性作为评估的一部分。结果表明,与两种替代解决方案相比,在使用我们的新颖的远程沉浸式MR方法时,在任务期间增强了用户交互和控制能力。此外,实验表明,将所提出的系统作为非专业人员和空中机器人之间的一种新的创新协作方法,在未知环境中进行勘探和检查任务,是有机会的。的视频:https://youtu.be/q8Dq-cNxcig
{"title":"Human-drone collaboration via mixed-reality for efficient navigation and interaction in constrained environments: a comprehensive user case study","authors":"Luca Morando,&nbsp;Xingyuan Zhou,&nbsp;Farokh Atashzar,&nbsp;Giuseppe Loianno","doi":"10.1007/s10514-025-10222-7","DOIUrl":"10.1007/s10514-025-10222-7","url":null,"abstract":"<div><p>Aerial Robots have the potential to play a crucial role in assisting humans in complex and dangerous tasks with the goal to decrease users’ cognitive and physical workload. In addition, many applications will require aerial robots to be ubiquitous and share the same environment with human operators. Therefore, this calls for novel solutions to enable seamless, transparent, and efficient human-drone collaboration and co-working in the same workspace. In this paper, we present a novel tele-immersive approach that promotes cognitive and physical collaboration between humans and robots through Mixed Reality (MR). We develop a bi-directional spatial awareness module and a new virtual-physical interaction approach integrated on a head-mounted display with MR. Furthermore, we design two alternative methods for spatial and physical interaction. Both solutions use a 2D monitor for spatial representation, with one method involving a mouse and keyboard, and the other using a haptic interface with the new VAC solution for physical interaction. This setup allows us to study how to analyze how different physical embodiments might compensate for reduced spatial representation during interaction tasks. Finally, to validate our approach and our comparative study, we propose a comprehensive user case study where 12 subjects with different expertise and background are tasked to complete a target reaching task in an indoor cluttered environment. We consider as part of the evaluation both subjective metrics, such as the System Usability Scale and the NASA Task Load Index, as well as objective measures, including completion time, distance traveled to reach the goal, and smoothness of movements. The results demonstrate enhanced user interaction and control capabilities during the task when using our novel novel tele-immersive approach with MR compared to the two alternative solutions. Additionally, the experiments show the opportunity to employ the proposed system as a new innovative collaboration approach between a non-expert human and an aerial robot for exploration and inspection tasks in unknown environments. Video: https://youtu.be/q8Dq-cNxcig</p></div>","PeriodicalId":55409,"journal":{"name":"Autonomous Robots","volume":"49 4","pages":""},"PeriodicalIF":4.3,"publicationDate":"2025-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145561603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Autonomous Robots
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1