检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Yiwei Zheng Aiwen Lai Xiao Yu Weiyao Lan
机构地区:[1]the Department of Automation,Xiamen University,Xiamen 361005 [2]the Key Laboratory of Control and Navigation(Xiamen University),Fujian Province University,Xiamen 361005,China [3]the Innovation Laboratory for Sciences and Technologies of Energy Materials of Fujian Province(IKKEM),Xiamen 361005,China
出 处:《IEEE/CAA Journal of Automatica Sinica》2023年第5期1346-1348,共3页自动化学报(英文版)
基 金:supported in part by the National Key R&D Program of China(2021ZD0112600);the National Natural Science Foundation of China(61873219,62103344,62173283);the Natural Science Foundation of Fujian Province of China(2021J01051,2021J05015);Science and Technology Projects of Innovation Laboratory for Sciences and Technologies of Energy Materials of Fujian Province(IKKEM)(HRTP-[2022]-25)。
摘 要:Dear Editor,This letter investigates a multi-agent path planning problem in a road network with the requirement of avoiding collisions among all agents in the partitioned environment.We first abstract the agents to a set of transition systems,and construct a team transition system from these individual systems.A mechanism is designed for the team transition system to detect all collisions within the synthesized run.
关 键 词:agent TEMPORAL INDIVIDUAL
分 类 号:O221[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.216.31.88