首页 > 最新文献

自主智能系统(英文)最新文献

英文 中文
An ontological modelling of multi-attribute criticality analysis to guide Prognostics and Health Management program development 多属性关键性分析的本体建模,以指导预后和健康管理项目的开发
Pub Date : 2022-03-02 DOI: 10.1007/s43684-022-00021-7
Adalberto Polenghi, Irene Roda, Marco Macchi, Alessandro Pozzetti

Digital technologies are becoming more pervasive and industrial companies are exploiting them to enhance the potentialities related to Prognostics and Health Management (PHM). Indeed, PHM allows to evaluate the health state of the physical assets as well as to predict their future behaviour. To be effective in developing PHM programs, the most critical assets should be identified so to direct modelling efforts. Several techniques could be adopted to evaluate asset criticality; in industrial practice, criticality analysis is amongst the most utilised. Despite the advancement of artificial intelligence for data analysis and predictions, the criticality analysis, which is built upon both quantitative and qualitative data, has not been improved accordingly. It is the goal of this work to propose an ontological formalisation of a multi-attribute criticality analysis in order to i) fix the semantics behind the terms involved in the analysis, ii) standardize and uniform the way criticality analysis is performed, and iii) take advantage of the reasoning capabilities to automatically evaluate asset criticality and associate a suitable maintenance strategy. The developed ontology, called MOCA, is tested in a food company featuring a global footprint. The application shows that MOCA can accomplish the prefixed goals; specifically, high priority assets towards which direct PHM programs are identified. In the long run, ontologies could serve as a unique knowledge base that integrate multiple data and information across facilities in a consistent way. As such, they will enable advanced analytics to take place, allowing to move towards cognitive Cyber Physical Systems that enhance business performance for companies spread worldwide.

数字技术正变得越来越普遍,工业企业正在利用这些技术来增强与诊断和健康管理(PHM)相关的潜力。事实上,PHM 可以评估有形资产的健康状态,并预测其未来行为。为了有效地制定 PHM 计划,应确定最关键的资产,以便指导建模工作。可以采用多种技术来评估资产的关键性;在工业实践中,关键性分析是最常用的技术之一。尽管人工智能在数据分析和预测方面取得了进步,但建立在定量和定性数据基础上的临界度分析却没有得到相应的改进。这项工作的目标是提出一种多属性临界度分析的本体形式化,以便 i) 固定分析中涉及的术语背后的语义,ii) 使临界度分析的执行方式标准化和统一化,iii) 利用推理能力自动评估资产临界度并关联合适的维护策略。所开发的本体(称为 MOCA)在一家遍布全球的食品公司进行了测试。应用结果表明,MOCA 可以实现预设的目标;特别是可以确定直接实施 PHM 计划的高优先级资产。从长远来看,本体可以作为一个独特的知识库,以一致的方式整合跨设施的多种数据和信息。因此,本体论可以进行高级分析,从而实现认知型网络物理系统,为遍布全球的公司提高业务绩效。
{"title":"An ontological modelling of multi-attribute criticality analysis to guide Prognostics and Health Management program development","authors":"Adalberto Polenghi,&nbsp;Irene Roda,&nbsp;Marco Macchi,&nbsp;Alessandro Pozzetti","doi":"10.1007/s43684-022-00021-7","DOIUrl":"10.1007/s43684-022-00021-7","url":null,"abstract":"<div><p>Digital technologies are becoming more pervasive and industrial companies are exploiting them to enhance the potentialities related to Prognostics and Health Management (PHM). Indeed, PHM allows to evaluate the health state of the physical assets as well as to predict their future behaviour. To be effective in developing PHM programs, the most critical assets should be identified so to direct modelling efforts. Several techniques could be adopted to evaluate asset criticality; in industrial practice, criticality analysis is amongst the most utilised. Despite the advancement of artificial intelligence for data analysis and predictions, the criticality analysis, which is built upon both quantitative and qualitative data, has not been improved accordingly. It is the goal of this work to propose an ontological formalisation of a multi-attribute criticality analysis in order to i) fix the semantics behind the terms involved in the analysis, ii) standardize and uniform the way criticality analysis is performed, and iii) take advantage of the reasoning capabilities to automatically evaluate asset criticality and associate a suitable maintenance strategy. The developed ontology, called MOCA, is tested in a food company featuring a global footprint. The application shows that MOCA can accomplish the prefixed goals; specifically, high priority assets towards which direct PHM programs are identified. In the long run, ontologies could serve as a unique knowledge base that integrate multiple data and information across facilities in a consistent way. As such, they will enable advanced analytics to take place, allowing to move towards cognitive Cyber Physical Systems that enhance business performance for companies spread worldwide.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-022-00021-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48152028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Neural network-based adaptive sliding mode control for underactuated dual overhead cranes suffering from matched and unmatched disturbances 基于神经网络的欠驱动双桥起重机匹配和非匹配扰动自适应滑模控制
Pub Date : 2022-01-07 DOI: 10.1007/s43684-021-00019-7
Tianci Wen, Yongchun Fang, Biao Lu

To improve transportation capacity, dual overhead crane systems (DOCSs) are playing an increasingly important role in the transportation of large/heavy cargos and containers. Unfortunately, when trying to deal with the control problem, current methods fail to fully consider such factors as external disturbances, input dead zones, parameter uncertainties, and other unmodeled dynamics that DOCSs usually suffer from. As a result, dramatic degradation is caused in the control performance, which badly hinders the practical applications of DOCSs. Motivated by this fact, this paper designs a neural network-based adaptive sliding mode control (SMC) method for DOCS to solve the aforementioned issues, which achieves satisfactory control performance for both actuated and underactuated state variables, even in the presence of matched and mismatched disturbances. The asymptotic stability of the desired equilibrium point is proved with rigorous Lyapunov-based analysis. Finally, extensive hardware experimental results are collected to verify the efficiency and robustness of the proposed method.

为了提高运输能力,双桥式起重机系统(DOCS)在大型/重型货物和集装箱运输中发挥着越来越重要的作用。遗憾的是,在试图解决控制问题时,当前的方法未能充分考虑外部干扰、输入死区、参数不确定性等因素,以及 DOCS 通常会遇到的其他未建模动态问题。因此,控制性能急剧下降,严重阻碍了 DOCS 的实际应用。受此启发,本文设计了一种基于神经网络的 DOCS 自适应滑模控制(SMC)方法来解决上述问题,该方法即使在存在匹配和不匹配干扰的情况下,也能对致动和欠致动状态变量实现令人满意的控制性能。基于严格的 Lyapunov 分析证明了理想平衡点的渐进稳定性。最后,还收集了大量硬件实验结果,以验证所提方法的效率和鲁棒性。
{"title":"Neural network-based adaptive sliding mode control for underactuated dual overhead cranes suffering from matched and unmatched disturbances","authors":"Tianci Wen,&nbsp;Yongchun Fang,&nbsp;Biao Lu","doi":"10.1007/s43684-021-00019-7","DOIUrl":"10.1007/s43684-021-00019-7","url":null,"abstract":"<div><p>To improve transportation capacity, dual overhead crane systems (DOCSs) are playing an increasingly important role in the transportation of large/heavy cargos and containers. Unfortunately, when trying to deal with the control problem, current methods fail to fully consider such factors as external disturbances, input dead zones, parameter uncertainties, and other unmodeled dynamics that DOCSs usually suffer from. As a result, dramatic degradation is caused in the control performance, which badly hinders the practical applications of DOCSs. Motivated by this fact, this paper designs a neural network-based adaptive sliding mode control (SMC) method for DOCS to solve the aforementioned issues, which achieves satisfactory control performance for both actuated and underactuated state variables, even in the presence of matched and mismatched disturbances. The asymptotic stability of the desired equilibrium point is proved with rigorous Lyapunov-based analysis. Finally, extensive hardware experimental results are collected to verify the efficiency and robustness of the proposed method.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-021-00019-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49006319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Task scheduling for transport and pick robots in logistics: a comparative study on constructive heuristics 物流中运输和拣选机器人的任务调度:构造启发式的比较研究
Pub Date : 2021-12-16 DOI: 10.1007/s43684-021-00017-9
Hanfu Wang, Weidong Chen

We study the Transport and Pick Robots Task Scheduling (TPS) problem, in which two teams of specialized robots, transport robots and pick robots, collaborate to execute multi-station order fulfillment tasks in logistic environments. The objective is to plan a collective time-extended task schedule with the minimization of makespan. However, for this recently formulated problem, it is still unclear how to obtain satisfying results efficiently. In this research, we design several constructive heuristics to solve this problem based on the introduced sequence models. Theoretically, we give time complexity analysis or feasibility guarantees of these heuristics; empirically, we evaluate the makespan performance criteria and computation time on designed dataset. Computational results demonstrate that coupled append heuristic works better for the most cases within reasonable computation time. Coupled heuristics work better than decoupled heuristics prominently on instances with relative few pick robot numbers and large work zones. The law of diminishing marginal utility is also observed concerning the overall system performance and different transport-pick robot numbers.

我们研究了运输和拣选机器人任务调度(TPS)问题,在该问题中,两组专业机器人(运输机器人和拣选机器人)协作执行物流环境中的多站订单执行任务。其目标是规划一个集体的时间扩展任务计划,并最大限度地减少时间跨度。然而,对于这个新近提出的问题,如何高效地获得令人满意的结果仍不清楚。在这项研究中,我们根据引入的序列模型设计了几种建设性启发式方法来解决这个问题。在理论上,我们给出了这些启发式方法的时间复杂性分析或可行性保证;在实证上,我们在设计的数据集上评估了补间性能标准和计算时间。计算结果证明,在大多数情况下,耦合附加启发式在合理的计算时间内效果更好。在拾取机器人数量相对较少、工作区域较大的情况下,耦合启发式比解耦启发式更有效。在整体系统性能和不同的运输-拾取机器人数量方面,也观察到了边际效用递减规律。
{"title":"Task scheduling for transport and pick robots in logistics: a comparative study on constructive heuristics","authors":"Hanfu Wang,&nbsp;Weidong Chen","doi":"10.1007/s43684-021-00017-9","DOIUrl":"10.1007/s43684-021-00017-9","url":null,"abstract":"<div><p>We study the Transport and Pick Robots Task Scheduling (TPS) problem, in which two teams of specialized robots, transport robots and pick robots, collaborate to execute multi-station order fulfillment tasks in logistic environments. The objective is to plan a collective time-extended task schedule with the minimization of makespan. However, for this recently formulated problem, it is still unclear how to obtain satisfying results efficiently. In this research, we design several constructive heuristics to solve this problem based on the introduced sequence models. Theoretically, we give time complexity analysis or feasibility guarantees of these heuristics; empirically, we evaluate the makespan performance criteria and computation time on designed dataset. Computational results demonstrate that coupled append heuristic works better for the most cases within reasonable computation time. Coupled heuristics work better than decoupled heuristics prominently on instances with relative few pick robot numbers and large work zones. The law of diminishing marginal utility is also observed concerning the overall system performance and different transport-pick robot numbers.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-021-00017-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41950817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hastily formed knowledge networks and distributed situation awareness for collaborative robotics 协作机器人快速形成的知识网络和分布式态势感知
Pub Date : 2021-12-07 DOI: 10.1007/s43684-021-00016-w
Patrick Doherty, Cyrille Berger, Piotr Rudol, Mariusz Wzorek

In the context of collaborative robotics, distributed situation awareness is essential for supporting collective intelligence in teams of robots and human agents where it can be used for both individual and collective decision support. This is particularly important in applications pertaining to emergency rescue and crisis management. During operational missions, data and knowledge are gathered incrementally and in different ways by heterogeneous robots and humans. We describe this as the creation of Hastily Formed Knowledge Networks (HFKNs). The focus of this paper is the specification and prototyping of a general distributed system architecture that supports the creation of HFKNs by teams of robots and humans. The information collected ranges from low-level sensor data to high-level semantic knowledge, the latter represented in part as RDF Graphs. The framework includes a synchronization protocol and associated algorithms that allow for the automatic distribution and sharing of data and knowledge between agents. This is done through the distributed synchronization of RDF Graphs shared between agents. High-level semantic queries specified in SPARQL can be used by robots and humans alike to acquire both knowledge and data content from team members. The system is empirically validated and complexity results of the proposed algorithms are provided. Additionally, a field robotics case study is described, where a 3D mapping mission has been executed using several UAVs in a collaborative emergency rescue scenario while using the full HFKN Framework.

在协作机器人技术中,分布式态势感知对于支持机器人和人类代理团队的集体智能至关重要,它既可用于个人决策支持,也可用于集体决策支持。这在与紧急救援和危机管理有关的应用中尤为重要。在执行任务期间,异构机器人和人类会以不同方式逐步收集数据和知识。我们将此称为 "快速形成的知识网络"(HFKNs)。本文的重点是对支持机器人和人类团队创建 HFKN 的通用分布式系统架构进行规范和原型开发。收集的信息范围从低级传感器数据到高级语义知识,后者部分以 RDF 图表示。该框架包括一个同步协议和相关算法,可在代理之间自动分发和共享数据与知识。这是通过代理之间共享的 RDF 图的分布式同步来实现的。机器人和人类都可以使用 SPARQL 中指定的高级语义查询,从团队成员那里获取知识和数据内容。该系统经过了经验验证,并提供了所提算法的复杂性结果。此外,还介绍了一个现场机器人案例研究,其中在一个协作紧急救援场景中使用多个无人机执行了 3D 绘图任务,同时使用了完整的 HFKN 框架。
{"title":"Hastily formed knowledge networks and distributed situation awareness for collaborative robotics","authors":"Patrick Doherty,&nbsp;Cyrille Berger,&nbsp;Piotr Rudol,&nbsp;Mariusz Wzorek","doi":"10.1007/s43684-021-00016-w","DOIUrl":"10.1007/s43684-021-00016-w","url":null,"abstract":"<div><p>In the context of collaborative robotics, distributed situation awareness is essential for supporting collective intelligence in teams of robots and human agents where it can be used for both individual and collective decision support. This is particularly important in applications pertaining to emergency rescue and crisis management. During operational missions, data and knowledge are gathered incrementally and in different ways by heterogeneous robots and humans. We describe this as the creation of <i>Hastily Formed Knowledge Networks</i> (HFKNs). The focus of this paper is the specification and prototyping of a general distributed system architecture that supports the creation of HFKNs by teams of robots and humans. The information collected ranges from low-level sensor data to high-level semantic knowledge, the latter represented in part as RDF Graphs. The framework includes a synchronization protocol and associated algorithms that allow for the automatic distribution and sharing of data and knowledge between agents. This is done through the distributed synchronization of RDF Graphs shared between agents. High-level semantic queries specified in SPARQL can be used by robots and humans alike to acquire both knowledge and data content from team members. The system is empirically validated and complexity results of the proposed algorithms are provided. Additionally, a field robotics case study is described, where a 3D mapping mission has been executed using several UAVs in a collaborative emergency rescue scenario while using the full HFKN Framework.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-021-00016-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42332368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Autonomous maneuver strategy of swarm air combat based on DDPG 基于DDPG的群空战自主机动策略
Pub Date : 2021-12-04 DOI: 10.1007/s43684-021-00013-z
Luhe Wang, Jinwen Hu, Zhao Xu, Chunhui Zhao

Unmanned aerial vehicles (UAVs) have been found significantly important in the air combats, where intelligent and swarms of UAVs will be able to tackle with the tasks of high complexity and dynamics. The key to empower the UAVs with such capability is the autonomous maneuver decision making. In this paper, an autonomous maneuver strategy of UAV swarms in beyond visual range air combat based on reinforcement learning is proposed. First, based on the process of air combat and the constraints of the swarm, the motion model of UAV and the multi-to-one air combat model are established. Second, a two-stage maneuver strategy based on air combat principles is designed which include inter-vehicle collaboration and target-vehicle confrontation. Then, a swarm air combat algorithm based on deep deterministic policy gradient strategy (DDPG) is proposed for online strategy training. Finally, the effectiveness of the proposed algorithm is validated by multi-scene simulations. The results show that the algorithm is suitable for UAV swarms of different scales.

无人驾驶飞行器(UAVs)在空战中发挥着重要作用,智能化和成群的无人驾驶飞行器将能够应对高复杂性和高动态性的任务。赋予无人机这种能力的关键在于自主机动决策。本文提出了一种基于强化学习的超视距空战无人机群自主机动策略。首先,基于空战过程和蜂群约束条件,建立无人机运动模型和多对一空战模型。其次,设计了基于空战原理的两阶段机动策略,包括飞行器之间的协作和目标飞行器之间的对抗。然后,提出了一种基于深度确定性策略梯度(DDPG)的蜂群空战算法,用于在线策略训练。最后,通过多场景仿真验证了所提算法的有效性。结果表明,该算法适用于不同规模的无人机群。
{"title":"Autonomous maneuver strategy of swarm air combat based on DDPG","authors":"Luhe Wang,&nbsp;Jinwen Hu,&nbsp;Zhao Xu,&nbsp;Chunhui Zhao","doi":"10.1007/s43684-021-00013-z","DOIUrl":"10.1007/s43684-021-00013-z","url":null,"abstract":"<div><p>Unmanned aerial vehicles (UAVs) have been found significantly important in the air combats, where intelligent and swarms of UAVs will be able to tackle with the tasks of high complexity and dynamics. The key to empower the UAVs with such capability is the autonomous maneuver decision making. In this paper, an autonomous maneuver strategy of UAV swarms in beyond visual range air combat based on reinforcement learning is proposed. First, based on the process of air combat and the constraints of the swarm, the motion model of UAV and the multi-to-one air combat model are established. Second, a two-stage maneuver strategy based on air combat principles is designed which include inter-vehicle collaboration and target-vehicle confrontation. Then, a swarm air combat algorithm based on deep deterministic policy gradient strategy (DDPG) is proposed for online strategy training. Finally, the effectiveness of the proposed algorithm is validated by multi-scene simulations. The results show that the algorithm is suitable for UAV swarms of different scales.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-021-00013-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48182104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed multi-robot sweep coverage for a region with unknown workload distribution 未知工作负载分布区域的分布式多机器人扫描覆盖
Pub Date : 2021-12-02 DOI: 10.1007/s43684-021-00011-1
Muqing Cao, Kun Cao, Xiuxian Li, Shenghai Yuan, Yang Lyu, Thien-Minh Nguyen, Lihua Xie

This paper considers the scenario where multiple robots collaboratively cover a region in which the exact distribution of workload is unknown prior to the operation. The workload distribution is not uniform in the region, meaning that the time required to cover a unit area varies at different locations of the region. In our approach, we divide the target region into multiple horizontal stripes, and the robots sweep the current stripe while partitioning the next stripe concurrently. We propose a distributed workload partition algorithm and prove that the operation time on each stripe converges to the minimum under the discrete-time update law. We conduct comprehensive simulation studies and compare our method with the existing methods to verify the theoretical results and the advantage of the proposed method. Flight experiments on mini drones are also conducted to demonstrate the practicality of the proposed algorithm.

本文考虑了多个机器人协作覆盖一个区域的情况,在该区域内,作业前工作量的确切分布是未知的。该区域内的工作量分布并不均匀,这意味着覆盖单位面积所需的时间在该区域的不同位置会有所不同。在我们的方法中,我们将目标区域划分为多个水平条纹,机器人在清扫当前条纹的同时,也会同时划分下一个条纹。我们提出了一种分布式工作量分区算法,并证明在离散时间更新规律下,每个条纹上的操作时间都会收敛到最小值。我们进行了全面的仿真研究,并将我们的方法与现有方法进行了比较,以验证理论结果和所提方法的优势。我们还在微型无人机上进行了飞行实验,以证明所提算法的实用性。
{"title":"Distributed multi-robot sweep coverage for a region with unknown workload distribution","authors":"Muqing Cao,&nbsp;Kun Cao,&nbsp;Xiuxian Li,&nbsp;Shenghai Yuan,&nbsp;Yang Lyu,&nbsp;Thien-Minh Nguyen,&nbsp;Lihua Xie","doi":"10.1007/s43684-021-00011-1","DOIUrl":"10.1007/s43684-021-00011-1","url":null,"abstract":"<div><p>This paper considers the scenario where multiple robots collaboratively cover a region in which the exact distribution of workload is unknown prior to the operation. The workload distribution is not uniform in the region, meaning that the time required to cover a unit area varies at different locations of the region. In our approach, we divide the target region into multiple horizontal stripes, and the robots sweep the current stripe while partitioning the next stripe concurrently. We propose a distributed workload partition algorithm and prove that the operation time on each stripe converges to the minimum under the discrete-time update law. We conduct comprehensive simulation studies and compare our method with the existing methods to verify the theoretical results and the advantage of the proposed method. Flight experiments on mini drones are also conducted to demonstrate the practicality of the proposed algorithm.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-021-00011-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44506233","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Router and gateway node placement in wireless mesh networks for emergency rescue scenarios 应急救援场景无线网状网络中的路由器和网关节点布置
Pub Date : 2021-12-02 DOI: 10.1007/s43684-021-00012-0
Mariusz Wzorek, Cyrille Berger, Patrick Doherty

The focus of this paper is on base functionalities required for UAV-based rapid deployment of an ad hoc communication infrastructure in the initial phases of rescue operations. The main idea is to use heterogeneous teams of UAVs to deploy communication kits that include routers, and are used in the generation of ad hoc Wireless Mesh Networks (WMN). Several fundamental problems are considered and algorithms are proposed to solve these problems. The Router Node Placement problem (RNP) and a generalization of it that takes into account additional constraints arising in actual field usage is considered first. The RNP problem tries to determine how to optimally place routers in a WMN. A new algorithm, the RRT-WMN algorithm, is proposed to solve this problem. It is based in part on a novel use of the Rapidly Exploring Random Trees (RRT) algorithm used in motion planning. A comparative empirical evaluation between the RRT-WMN algorithm and existing techniques such as the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) and Particle Swarm Optimization (PSO), shows that the RRT-WMN algorithm has far better performance both in amount of time taken and regional coverage as the generalized RNP problem scales to realistic scenarios. The Gateway Node Placement Problem (GNP) tries to determine how to locate a minimal number of gateway nodes in a WMN backbone network while satisfying a number of Quality of Service (QoS) constraints.Two alternatives are proposed for solving the combined RNP-GNP problem. The first approach combines the RRT-WMN algorithm with a preexisting graph clustering algorithm. The second approach, WMNbyAreaDecomposition, proposes a novel divide-and-conquer algorithm that recursively partitions a target deployment area into a set of disjoint regions, thus creating a number of simpler RNP problems that are then solved concurrently. Both algorithms are evaluated on real-world GIS models of different size and complexity. WMNbyAreaDecomposition is shown to outperform existing algorithms using 73% to 92% fewer router nodes while at the same time satisfying all QoS requirements.

本文的重点是无人机在救援行动初期快速部署临时通信基础设施所需的基本功能。主要想法是使用异构无人机团队部署包括路由器在内的通信套件,并用于生成特设无线网状网络(WMN)。研究考虑了几个基本问题,并提出了解决这些问题的算法。首先考虑的是路由器节点放置问题(RNP)以及考虑到实际现场使用中出现的额外约束条件的该问题的一般化。RNP 问题试图确定如何在 WMN 中以最佳方式放置路由器。为解决这一问题,提出了一种新算法,即 RRT-WMN 算法。该算法部分基于运动规划中使用的快速探索随机树(RRT)算法。RRT-WMN 算法与现有技术(如协方差矩阵适应进化策略(CMA-ES)和粒子群优化(PSO))之间的经验比较评估表明,当广义 RNP 问题扩展到现实场景时,RRT-WMN 算法在耗时和区域覆盖方面都有更好的表现。网关节点安置问题(GNP)试图确定如何在 WMN 骨干网络中安置最少数量的网关节点,同时满足一系列服务质量(QoS)约束。第一种方法将 RRT-WMN 算法与已有的图聚类算法相结合。第二种方法是 WMNbyAreaDecomposition,它提出了一种新颖的 "分而治之 "算法,将目标部署区域递归划分为一组互不相交的区域,从而创建了许多更简单的 RNP 问题,然后并发解决这些问题。这两种算法都在不同规模和复杂度的真实世界 GIS 模型上进行了评估。结果表明,WMNbyAreaDecomposition 在满足所有 QoS 要求的同时,路由器节点数量减少了 73% 到 92%,性能优于现有算法。
{"title":"Router and gateway node placement in wireless mesh networks for emergency rescue scenarios","authors":"Mariusz Wzorek,&nbsp;Cyrille Berger,&nbsp;Patrick Doherty","doi":"10.1007/s43684-021-00012-0","DOIUrl":"10.1007/s43684-021-00012-0","url":null,"abstract":"<div><p>The focus of this paper is on base functionalities required for UAV-based rapid deployment of an ad hoc communication infrastructure in the initial phases of rescue operations. The main idea is to use heterogeneous teams of UAVs to deploy communication kits that include routers, and are used in the generation of ad hoc Wireless Mesh Networks (WMN). Several fundamental problems are considered and algorithms are proposed to solve these problems. The Router Node Placement problem (RNP) and a generalization of it that takes into account additional constraints arising in actual field usage is considered first. The RNP problem tries to determine how to optimally place routers in a WMN. A new algorithm, the RRT-WMN algorithm, is proposed to solve this problem. It is based in part on a novel use of the Rapidly Exploring Random Trees (RRT) algorithm used in motion planning. A comparative empirical evaluation between the RRT-WMN algorithm and existing techniques such as the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) and Particle Swarm Optimization (PSO), shows that the RRT-WMN algorithm has far better performance both in amount of time taken and regional coverage as the generalized RNP problem scales to realistic scenarios. The Gateway Node Placement Problem (GNP) tries to determine how to locate a minimal number of gateway nodes in a WMN backbone network while satisfying a number of Quality of Service (QoS) constraints.Two alternatives are proposed for solving the combined RNP-GNP problem. The first approach combines the RRT-WMN algorithm with a preexisting graph clustering algorithm. The second approach, WMNbyAreaDecomposition, proposes a novel divide-and-conquer algorithm that recursively partitions a target deployment area into a set of disjoint regions, thus creating a number of simpler RNP problems that are then solved concurrently. Both algorithms are evaluated on real-world GIS models of different size and complexity. WMNbyAreaDecomposition is shown to outperform existing algorithms using 73% to 92% fewer router nodes while at the same time satisfying all QoS requirements.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-021-00012-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42418948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
UAV low-altitude obstacle detection based on the fusion of LiDAR and camera 基于激光雷达与摄像头融合的无人机低空障碍物检测
Pub Date : 2021-11-26 DOI: 10.1007/s43684-021-00014-y
Zhaowei Ma, Wenchen Yao, Yifeng Niu, Bosen Lin, Tianqing Liu

In this paper, aiming at the flying scene of the small unmanned aerial vehicle (UAV) in the low-altitude suburban environment, we choose the sensor configuration scheme of LiDAR and visible light camera, and design the static and dynamic obstacle detection algorithms based on sensor fusion. For static obstacles such as power lines and buildings in the low-altitude environment, the way that image-assisted verification of point clouds is used to fuse the contour information of the images and the depth information of the point clouds to obtain the location and size of static obstacles. For unknown dynamic obstacles such as rotary-wing UAVs, the IMM-UKF algorithm is designed to fuse the distance measurement information of point clouds and the high precision angle measurement information of image to achieve accurate estimation of the location and velocity of the dynamic obstacles. We build an experimental platform to verify the effectiveness of the obstacle detection algorithm in actual scenes and evaluate the relevant performance indexes.

本文针对小型无人飞行器(UAV)在郊区低空环境中的飞行场景,选择激光雷达和可见光相机的传感器配置方案,设计了基于传感器融合的静态和动态障碍物检测算法。对于低空环境中的电线、建筑物等静态障碍物,采用图像辅助点云验证的方式,融合图像的轮廓信息和点云的深度信息,获取静态障碍物的位置和大小。针对旋翼无人机等未知动态障碍物,设计了 IMM-UKF 算法,融合点云的距离测量信息和图像的高精度角度测量信息,实现对动态障碍物位置和速度的精确估计。我们搭建了一个实验平台来验证障碍物检测算法在实际场景中的有效性,并对相关性能指标进行了评估。
{"title":"UAV low-altitude obstacle detection based on the fusion of LiDAR and camera","authors":"Zhaowei Ma,&nbsp;Wenchen Yao,&nbsp;Yifeng Niu,&nbsp;Bosen Lin,&nbsp;Tianqing Liu","doi":"10.1007/s43684-021-00014-y","DOIUrl":"10.1007/s43684-021-00014-y","url":null,"abstract":"<div><p>In this paper, aiming at the flying scene of the small unmanned aerial vehicle (UAV) in the low-altitude suburban environment, we choose the sensor configuration scheme of LiDAR and visible light camera, and design the static and dynamic obstacle detection algorithms based on sensor fusion. For static obstacles such as power lines and buildings in the low-altitude environment, the way that image-assisted verification of point clouds is used to fuse the contour information of the images and the depth information of the point clouds to obtain the location and size of static obstacles. For unknown dynamic obstacles such as rotary-wing UAVs, the IMM-UKF algorithm is designed to fuse the distance measurement information of point clouds and the high precision angle measurement information of image to achieve accurate estimation of the location and velocity of the dynamic obstacles. We build an experimental platform to verify the effectiveness of the obstacle detection algorithm in actual scenes and evaluate the relevant performance indexes.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-021-00014-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43723158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Autonomous vehicles for micro-mobility 用于微型移动的自动驾驶汽车
Pub Date : 2021-11-22 DOI: 10.1007/s43684-021-00010-2
Henrik Christensen, David Paz, Hengyuan Zhang, Dominique Meyer, Hao Xiang, Yunhai Han, Yuhan Liu, Andrew Liang, Zheng Zhong, Shiqi Tang

Autonomous vehicles have been envisioned for more than 100 years. One of the first suggestions was a front cover of Scientific America back in 1916. Today, it is possible to get cars that drive autonomously for extended distances. We are also starting to see micro-mobility solutions, such as the Nuro vehicles for pizza delivery. Building autonomous cars that can operate in urban environments with a diverse set of road-users is far from trivial. Early 2018 the Contextual Robotics Institute at UC San Diego launched an effort to build a full stack autonomous vehicle for micro-mobility. The motivations were diverse: i) development of a system for operation in an environment with many pedestrians, ii) design of a system that does not rely on dense maps (or HD-maps as they are sometimes named), iii) design strategies to build truly robust systems, and iv) a framework to educate next-generation engineers. In this paper, we present the research effort of design, prototyping, and evaluation of such a vehicle. From the evaluation, several research directions are explored to account for shortcomings. Lessons and issues for future work are additionally drawn from this work.

人们对自动驾驶汽车的设想已有 100 多年的历史。早在 1916 年,《科学美国》的封面就刊登了最早的设想之一。如今,我们已经可以实现汽车的长距离自动驾驶。我们也开始看到微型移动解决方案,例如用于送披萨的 Nuro 汽车。打造能够在城市环境中与不同的道路使用者一起运行的自动驾驶汽车绝非易事。2018 年初,加州大学圣地亚哥分校的语境机器人研究所(Contextual Robotics Institute)发起了一项为微型交通打造全栈式自动驾驶汽车的努力。其动机多种多样:i) 开发在有许多行人的环境中运行的系统;ii) 设计一个不依赖密集地图(或有时被称为高清地图)的系统;iii) 设计构建真正稳健系统的策略;iv) 一个教育下一代工程师的框架。在本文中,我们介绍了对这种车辆的设计、原型制作和评估等研究工作。通过评估,我们探讨了几个研究方向,以弥补不足之处。此外,我们还从这项工作中汲取了经验教训,并提出了今后工作中应注意的问题。
{"title":"Autonomous vehicles for micro-mobility","authors":"Henrik Christensen,&nbsp;David Paz,&nbsp;Hengyuan Zhang,&nbsp;Dominique Meyer,&nbsp;Hao Xiang,&nbsp;Yunhai Han,&nbsp;Yuhan Liu,&nbsp;Andrew Liang,&nbsp;Zheng Zhong,&nbsp;Shiqi Tang","doi":"10.1007/s43684-021-00010-2","DOIUrl":"10.1007/s43684-021-00010-2","url":null,"abstract":"<div><p>Autonomous vehicles have been envisioned for more than 100 years. One of the first suggestions was a front cover of Scientific America back in 1916. Today, it is possible to get cars that drive autonomously for extended distances. We are also starting to see micro-mobility solutions, such as the Nuro vehicles for pizza delivery. Building autonomous cars that can operate in urban environments with a diverse set of road-users is far from trivial. Early 2018 the Contextual Robotics Institute at UC San Diego launched an effort to build a full stack autonomous vehicle for micro-mobility. The motivations were diverse: i) development of a system for operation in an environment with many pedestrians, ii) design of a system that does not rely on dense maps (or HD-maps as they are sometimes named), iii) design strategies to build truly robust systems, and iv) a framework to educate next-generation engineers. In this paper, we present the research effort of design, prototyping, and evaluation of such a vehicle. From the evaluation, several research directions are explored to account for shortcomings. Lessons and issues for future work are additionally drawn from this work.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-021-00010-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47382701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
WARA-PS: a research arena for public safety demonstrations and autonomous collaborative rescue robotics experimentation WARA-PS:公共安全演示和自主协作救援机器人实验的研究场所
Pub Date : 2021-11-16 DOI: 10.1007/s43684-021-00009-9
Olov Andersson, Patrick Doherty, Mårten Lager, Jens-Olof Lindh, Linnea Persson, Elin A. Topp, Jesper Tordenlid, Bo Wahlberg

A research arena (WARA-PS) for sensing, data fusion, user interaction, planning and control of collaborative autonomous aerial and surface vehicles in public safety applications is presented. The objective is to demonstrate scientific discoveries and to generate new directions for future research on autonomous systems for societal challenges. The enabler is a computational infrastructure with a core system architecture for industrial and academic collaboration. This includes a control and command system together with a framework for planning and executing tasks for unmanned surface vehicles and aerial vehicles. The motivating application for the demonstration is marine search and rescue operations. A state-of-art delegation framework for the mission planning together with three specific applications is also presented. The first one concerns model predictive control for cooperative rendezvous of autonomous unmanned aerial and surface vehicles. The second project is about learning to make safe real-time decisions under uncertainty for autonomous vehicles, and the third one is on robust terrain-aided navigation through sensor fusion and virtual reality tele-operation to support a GPS-free positioning system in marine environments. The research results have been experimentally evaluated and demonstrated to industry and public sector audiences at a marine test facility. It would be most difficult to do experiments on this large scale without the WARA-PS research arena. Furthermore, these demonstrator activities have resulted in effective research dissemination with high public visibility, business impact and new research collaborations between academia and industry.

介绍了公共安全应用中协同自主空中和地面飞行器的传感、数据融合、用户交互、规划和控制的研究领域(WARA-PS)。其目的是展示科学发现,并为未来研究自主系统应对社会挑战提供新方向。其推动因素是一个具有核心系统架构的计算基础设施,用于工业和学术合作。这包括一个控制和指挥系统,以及一个用于规划和执行无人水面飞行器和空中飞行器任务的框架。演示的激励应用是海上搜救行动。此外,还介绍了任务规划的最新授权框架以及三个具体应用。第一个项目涉及自主无人驾驶飞行器和水面飞行器合作会合的模型预测控制。第二个项目是学习在不确定情况下为自主飞行器做出安全的实时决策,第三个项目是通过传感器融合和虚拟现实远程操作实现稳健的地形辅助导航,以支持海洋环境中的无 GPS 定位系统。研究成果已经过实验评估,并在海洋测试设施中向工业界和公共部门的受众进行了展示。如果没有 WARA-PS 研究平台,很难进行如此大规模的实验。此外,这些示范活动还有效地传播了研究成果,提高了公众知名度,产生了商业影响,并在学术界和产业界之间建立了新的研究合作关系。
{"title":"WARA-PS: a research arena for public safety demonstrations and autonomous collaborative rescue robotics experimentation","authors":"Olov Andersson,&nbsp;Patrick Doherty,&nbsp;Mårten Lager,&nbsp;Jens-Olof Lindh,&nbsp;Linnea Persson,&nbsp;Elin A. Topp,&nbsp;Jesper Tordenlid,&nbsp;Bo Wahlberg","doi":"10.1007/s43684-021-00009-9","DOIUrl":"10.1007/s43684-021-00009-9","url":null,"abstract":"<div><p>A research arena (WARA-PS) for sensing, data fusion, user interaction, planning and control of collaborative autonomous aerial and surface vehicles in public safety applications is presented. The objective is to demonstrate scientific discoveries and to generate new directions for future research on autonomous systems for societal challenges. The enabler is a computational infrastructure with a core system architecture for industrial and academic collaboration. This includes a control and command system together with a framework for planning and executing tasks for unmanned surface vehicles and aerial vehicles. The motivating application for the demonstration is marine search and rescue operations. A state-of-art delegation framework for the mission planning together with three specific applications is also presented. The first one concerns model predictive control for cooperative rendezvous of autonomous unmanned aerial and surface vehicles. The second project is about learning to make safe real-time decisions under uncertainty for autonomous vehicles, and the third one is on robust terrain-aided navigation through sensor fusion and virtual reality tele-operation to support a GPS-free positioning system in marine environments. The research results have been experimentally evaluated and demonstrated to industry and public sector audiences at a marine test facility. It would be most difficult to do experiments on this large scale without the WARA-PS research arena. Furthermore, these demonstrator activities have resulted in effective research dissemination with high public visibility, business impact and new research collaborations between academia and industry.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-021-00009-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41391680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
自主智能系统(英文)
全部 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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1