Real Time UAVs Task Allocation with Moving Targets

2004 ◽  
Author(s):  
Demetrio Turra ◽  
Lorenzo Pollini ◽  
Mario Innocenti
Keyword(s):  
Real Time ◽  
Task Allocation ◽  
Moving Targets

Moving targets tracking on a mobile infrared platform and its real-time application on GPU

2014 ◽  
Author(s):  
Chen Peng ◽  
Qian Chen ◽  
Wei-xian Qian ◽  
Zhuang Miao ◽  
Xiao-yi Jin
Keyword(s):  
Real Time ◽  
Moving Targets ◽  
Real Time Application

scholarly journals A Phlegm Stagnation Monitoring Based on VDS Algorithm

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Zhiguo Gao ◽  
Xin Yu
Keyword(s):  
Real Time ◽  
Monitoring System ◽  
Moving Objects ◽  
Recognition Rate ◽  
Differential Method ◽  
Video Frame ◽  
Moving Targets ◽  
System A ◽  
Video Images ◽  
Svm Algorithm

In the nonmedical sputum monitoring system, a practical solution for phlegm stagnation care of patients was proposed. Through the camera, the video images of patients’ laryngeal area were obtained in real time. After processing and analysis on these video frame images, the throat movement area was found out. A three-frame differential method was used to detect the throat moving targets. Anomalies were identified according to the information of moving targets and the proposed algorithm. Warning on the abnormal situation can help nursing personnel to deal with sputum blocking problem more effectively. To monitor the patients’ situation in real time, this paper proposed a VDS algorithm, which extracted the speed characteristics of moving objects and combined with the DTW algorithm and SVM algorithm for sequence image classification. Phlegm stagnation symptoms of patients were identified timely for further medical care. In order to evaluate the effectiveness, our method was compared with the DTW, SVM, CTM, and HMM methods. The experimental results showed that this method had a higher recognition rate and was more practical in a nonmedical monitoring system.

scholarly journals A mutual-selecting market-based mechanism for dynamic coalition formation

2018 ◽  
Vol 15 (1) ◽  
pp. 172988141875584 ◽  
Author(s):  
Bing Xie ◽  
Shaofei Chen ◽  
Jing Chen ◽  
LinCheng Shen
Keyword(s):  
Real Time ◽  
Coalition Formation ◽  
Task Allocation ◽  
Completion Rate ◽  
Utilization Rate ◽  
Task Completion ◽  
Distributed Agents ◽  
Time Task ◽  
Comparable Performance ◽  
Negotiation Mechanism

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).

scholarly journals First experimental investigation of simultaneously tracking two independently moving targets on an MRI‐linac using real‐time MRI and MLC tracking

2020 ◽  
Author(s):  
Paul Z. Y. Liu ◽  
Bing Dong ◽  
Doan Trang Nguyen ◽  
Yuanyuan Ge ◽  
Emily A. Hewson ◽  
...  
Keyword(s):  
Experimental Investigation ◽  
Real Time ◽  
Moving Targets

scholarly journals A new load balancing strategy by task allocation in edge computing based on intermediary nodes

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Guangshun Li ◽  
Yonghui Yao ◽  
Junhua Wu ◽  
Xiaoxiao Liu ◽  
Xiaofei Sheng ◽  
...  
Keyword(s):  
Load Balancing ◽  
Real Time ◽  
Task Allocation ◽  
Normal Load ◽  
Task Assignment ◽  
Edge Computing ◽  
Heavy Load ◽  
Light Load ◽  
Assignment Model ◽  
Classification Evaluation

AbstractThe latency of cloud computing is high for the reason that it is far from terminal users. Edge computing can transfer computing from the center to the network edge. However, the problem of load balancing among different edge nodes still needs to be solved. In this paper, we propose a load balancing strategy by task allocation in edge computing based on intermediary nodes. The intermediary node is used to monitor the global information to obtain the real-time attributes of the edge nodes and complete the classification evaluation. First, edge nodes can be classified to three categories (light-load, normal-load, and heavy-load), according to their inherent attributes and real-time attributes. Then, we propose a task assignment model and allocate new tasks to the relatively lightest load node. Experiments show that our method can balance load among edge nodes and reduce the completion time of tasks.

Sign in / Sign up

Export Citation Format

Share Document