Bing Xie

Dr. Bing Xie

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018 in International Journal of Advanced Robotic Systems
Verified
Journal Article
Open access
BXBing Xie
Bing Xie
SCShaofei Chen
Shaofei Chen
JCJing Chen
Jing Chen
LSLinCheng Shen
LinCheng Shen
This article presents a novel market-based mechanism for a dynamic coalition formation problem backgrounded under real-time task allocation. Specifically, we first analyze the main factors of the real-time task allocation problem, and formulate the problem based on the coalition game theory. Then, we employ a social network for communication among distributed agents in this problem, and propose a negotiation mechanism for agents forming coalitions on timely emerging tasks. In this mechanism, we utilize an auction algorithm for real-time agent assignment on coalitions, and then design a mutual-selecting method to acquire better performance on agent utilization rate and task completion rate. And finally, our experimental results demonstrate that our market-based mechanism has a comparable performance in task completion rate to a decentralized approach (within 25% better on average) and a centralized dynamic coalition formation method (within 10% less on average performance).

1 November 2018 in International Journal of Advanced Robotic Systems
Verified
Journal Article
Open access
PDF file
BXBing Xie
Bing Xie
XGXueqiang Gu
Xueqiang Gu
JCJing Chen
Jing Chen
LSLinCheng Shen
LinCheng Shen
In this article, we study a problem of dynamic task allocation with multiple agent responsibilities in distributed multi-agent systems. Agents in the research have two responsibilities, communication and task execution. Movements in agent task execution bring changes to the system network structure, which will affect the communication. Thus, agents need to be autonomous on communication network reconstruction for good performance on task execution. First, we analyze the relationships between the two responsibilities of agents. Then, we design a multi-responsibility–oriented coalition formation framework for dynamic task allocation with two parts, namely, task execution and self-adaptation communication. For the former part, we integrate our formerly proposed algorithm in the framework for task execution coalition formation. For the latter part, we develop a constrained Bayesian overlapping coalition game model to formulate the communication network. A task-allocation efficiency–oriented communication coalition utility function is defined to optimize a coalition structure for the constrained Bayesian overlapping coalition game model. Considering the geographical location dependence between the two responsibilities, we define constrained agent strategies to map agent strategies to potential location choices. Based on the abovementioned design, we propose a distributed location pruning self-adaptive algorithm for the constrained Bayesian overlapping coalition formation. Finally, we test the performance of our framework, multi-responsibility–oriented coalition formation framework, with simulation experiments. Experimental results demonstrate that the multi-responsibility oriented coalition formation framework performs better than the other two distributed algorithms on task completion rate (by over 9.4% and over 65% on average, respectively).

4 March 2025
Verified
Book Chapter
Closed access
PDF file
RXRui Xu
Rui Xu
BXBing Xie
Bing Xie
XGXueqiang Gu
Xueqiang Gu
SBShengjian Bai
Shengjian Bai

15 December 2023
Verified
Conference Paper
Closed access
WLWenjie Liu
Wenjie Liu
BZBoyou Zheng
Boyou Zheng
YGYunxiang Ge
Yunxiang Ge
BXBing Xie
Bing Xie
This paper focuses on an Optimal Problem of Multibeam Survey Line (OPMSL) under complex and variable terrain of seabed. Firstly, we analyze overlap rate and coverage width of the lines in different course directions during multibeam line surveying, based on which we establish an Isobath path planning model. Then, we analyze the angle relationship between the slope line and the survey line, and projected the OPPM from 3D surface to the two-dimensional space. Throughout the dimension reduction processing, it actually reduces the problem search space. Thirdly, considering irregular and continuous slope characteristics of seabed topography, we propose to use greedy algorithms to solve the OPPM. Finally, we design a series of simulation experiment to check our algorithm performance. The result shows that, isobath path planning according to the greedy algorithm is optimal.