为解决足球比赛场内球员的多目标跟踪任务中,因场外人员对跟踪的干扰,球员频繁地运动、互相遮挡,以及摄像镜头复杂地移动等情况,造成的跟踪准确度低、跟踪目标ID(identity)保持能力弱的问题,提出一种适用于足球场内球员跟踪的多目标跟...为解决足球比赛场内球员的多目标跟踪任务中,因场外人员对跟踪的干扰,球员频繁地运动、互相遮挡,以及摄像镜头复杂地移动等情况,造成的跟踪准确度低、跟踪目标ID(identity)保持能力弱的问题,提出一种适用于足球场内球员跟踪的多目标跟踪数据集和多目标跟踪算法。通过条件生成对抗网络分割出球场区域,筛选出球场内的基于YOLOX框架的目标检测结果;在数据关联阶段,设计一种融合IoU(intersection over union)与欧式距离的代价矩阵进行目标间的相似性度量;利用足球比赛上场人数存在上限的先验条件,弹性约束跟踪目标ID的增长。实验结果表明,针对足球场内球员的跟踪问题,该算法能够在多目标跟踪准确度、跟踪目标ID保持能力上有极大提高。展开更多
This work presents an anticipatory terminal iterative learning control scheme for a class of batch proc- esses, where only the final system output is measurable and the control input is constant in each operations. Th...This work presents an anticipatory terminal iterative learning control scheme for a class of batch proc- esses, where only the final system output is measurable and the control input is constant in each operations. The propgsed approach works well with input constraints provided that the desired control input with respect to the desired trajectory is within the samratiorl bound. The tracking error convergence is established with rigorous mathe- matical analysis. Simulation results .are provided to showthe effectiveness, of the proposed approach.展开更多
A grasping force control strategy is proposed in order to complete various free manipulations by using anthropomorphic prosthetic hand. The position-based impedance control and force-tracking impedance control are use...A grasping force control strategy is proposed in order to complete various free manipulations by using anthropomorphic prosthetic hand. The position-based impedance control and force-tracking impedance control are used in free and constraint spaces, respectively. The fuzzy observer is adopted in transition in order to switch control mode. Two control modes use one position-based impedance controller. In order to achieve grasping force track, reference force is added to the impedance controller in the constraint space. Trajectory tracking in free space and torque tracking in constrained space are realized, and reliability of mode switch and stability of system are achieved. An adaptive sliding mode friction compensation method is proposed. This method makes use of terminal sliding mode idea to design sliding mode function, which makes the tracking error converge to zero in finite time and avoids the problem of conventional sliding surface that tracking error cannot converge to zero. Based on the characteristic of the exponential form friction, the sliding mode control law including the estimation of friction parameter is obtained through terminal sliding mode idea, and the online parameter update laws are obtained based on Lyapunov stability theorem. The experiments on the HIT Prosthetic Hand IV are carried out to evaluate the grasping force control strategy, and the experiment results verify the effectiveness of this control strategy.展开更多
In order to improve the transmission accuracy and efficiency of sensing and actuating signals in Internet of Things (loT) and ensure the system stability, an adaptive resource allocation algorithm is proposed, which...In order to improve the transmission accuracy and efficiency of sensing and actuating signals in Internet of Things (loT) and ensure the system stability, an adaptive resource allocation algorithm is proposed, which dynami- cally assigns the network bandwidth and priority among components according to their signals' frequency domain characteristics. A remote sensed and controlled unmanned ground vehicle (UGV) path tracking test-bed was devel- oped and multiple UGV's tracking error signals were measured in the simulation for performance evaluation. Results show that with the same network bandwidth constraints, the proposed algorithm can reduce,, the accumulated and maximum errors of UGV path tracking by over 60% compared with the conventional static algorithm.展开更多
A typical Markov network for modeling the interaction among targets can handle the error merge problem,but it suffers from the labeling problem due to the blind competition among collaborative trackers. In this paper,...A typical Markov network for modeling the interaction among targets can handle the error merge problem,but it suffers from the labeling problem due to the blind competition among collaborative trackers. In this paper,we propose a motion constraint Markov network model for multi-target tracking. By augmenting the typical Markov network with an ad hoc Markov chain which carries motion constraint prior,this proposed model can overcome the blind competition and direct the label to the corresponding target even in the case of severe occlusion. In addition,the motion constraint prior is formu-lated as a local potential function and can be easily incorporated in the joint distribution representation of the novel model. Experimental results demonstrate that our model is superior to other methods in solving the error merge and labeling problems simultaneously and efficiently.展开更多
The paper proposes an economical and fast algorithm for deriving trajectories from sporadic tracking points collected in location-based services (LBS). Although many traffic studies or applications can benefit from th...The paper proposes an economical and fast algorithm for deriving trajectories from sporadic tracking points collected in location-based services (LBS). Although many traffic studies or applications can benefit from the derived trajectories, the sporadic tracking points are always implicitly overlooked by most of existing map-matching algorithms. The algorithm proposed in this paper finds network paths or trajectories traveled by vehicles through augmenting GPS data with odometer data. An odometer can provide data of traveled distance which are compared with the lengths of candidate network paths in order to find the most approximate network path approaching the trajectory of a vehicle. Tracking points are classified into anchor points and non-anchor points. The former are used to divide trajectories, and the latter screen candidate network paths. An elliptic selection zone and a reduction process are applied to the selection of possible road segments composing candidate network paths. A brute-force searching algorithm is developed to find candidate network paths and calculate their lengths. A two-step screening process is designed to select the final result from candidate network paths. Finally, a series of experiments are conducted to validate the proposed algorithm.展开更多
文摘为解决足球比赛场内球员的多目标跟踪任务中,因场外人员对跟踪的干扰,球员频繁地运动、互相遮挡,以及摄像镜头复杂地移动等情况,造成的跟踪准确度低、跟踪目标ID(identity)保持能力弱的问题,提出一种适用于足球场内球员跟踪的多目标跟踪数据集和多目标跟踪算法。通过条件生成对抗网络分割出球场区域,筛选出球场内的基于YOLOX框架的目标检测结果;在数据关联阶段,设计一种融合IoU(intersection over union)与欧式距离的代价矩阵进行目标间的相似性度量;利用足球比赛上场人数存在上限的先验条件,弹性约束跟踪目标ID的增长。实验结果表明,针对足球场内球员的跟踪问题,该算法能够在多目标跟踪准确度、跟踪目标ID保持能力上有极大提高。
基金Supported by the National Natural Science Foundation of China (60974040, 61120106009), the Research Award Foundation for the Excellent Youth Scientists of Shandong Province of China (BS2011DX010), and the High School Science & Technol- ogy Fund Planning Project of Shandong Province of China (J 10LG32).
文摘This work presents an anticipatory terminal iterative learning control scheme for a class of batch proc- esses, where only the final system output is measurable and the control input is constant in each operations. The propgsed approach works well with input constraints provided that the desired control input with respect to the desired trajectory is within the samratiorl bound. The tracking error convergence is established with rigorous mathe- matical analysis. Simulation results .are provided to showthe effectiveness, of the proposed approach.
基金Project(2009AA043803) supported by the National High Technology Research and Development Program of China Project (SKLRS200901B) supported by Self-Planned Task of State Key Laboratory of Robotics and System (Harbin Institute of Technology),ChinaProject (NCET-09-0056) supported by Program for New Century Excellent Talents in Universities of China
文摘A grasping force control strategy is proposed in order to complete various free manipulations by using anthropomorphic prosthetic hand. The position-based impedance control and force-tracking impedance control are used in free and constraint spaces, respectively. The fuzzy observer is adopted in transition in order to switch control mode. Two control modes use one position-based impedance controller. In order to achieve grasping force track, reference force is added to the impedance controller in the constraint space. Trajectory tracking in free space and torque tracking in constrained space are realized, and reliability of mode switch and stability of system are achieved. An adaptive sliding mode friction compensation method is proposed. This method makes use of terminal sliding mode idea to design sliding mode function, which makes the tracking error converge to zero in finite time and avoids the problem of conventional sliding surface that tracking error cannot converge to zero. Based on the characteristic of the exponential form friction, the sliding mode control law including the estimation of friction parameter is obtained through terminal sliding mode idea, and the online parameter update laws are obtained based on Lyapunov stability theorem. The experiments on the HIT Prosthetic Hand IV are carried out to evaluate the grasping force control strategy, and the experiment results verify the effectiveness of this control strategy.
基金Supported by Natural Science Foundation of Tianjin (No. 07JCZDJC05800)Science and Technology Supporting Plan of Tianjin (No. 09ZCKFGX29200)
文摘In order to improve the transmission accuracy and efficiency of sensing and actuating signals in Internet of Things (loT) and ensure the system stability, an adaptive resource allocation algorithm is proposed, which dynami- cally assigns the network bandwidth and priority among components according to their signals' frequency domain characteristics. A remote sensed and controlled unmanned ground vehicle (UGV) path tracking test-bed was devel- oped and multiple UGV's tracking error signals were measured in the simulation for performance evaluation. Results show that with the same network bandwidth constraints, the proposed algorithm can reduce,, the accumulated and maximum errors of UGV path tracking by over 60% compared with the conventional static algorithm.
文摘A typical Markov network for modeling the interaction among targets can handle the error merge problem,but it suffers from the labeling problem due to the blind competition among collaborative trackers. In this paper,we propose a motion constraint Markov network model for multi-target tracking. By augmenting the typical Markov network with an ad hoc Markov chain which carries motion constraint prior,this proposed model can overcome the blind competition and direct the label to the corresponding target even in the case of severe occlusion. In addition,the motion constraint prior is formu-lated as a local potential function and can be easily incorporated in the joint distribution representation of the novel model. Experimental results demonstrate that our model is superior to other methods in solving the error merge and labeling problems simultaneously and efficiently.
基金Supported by the National Natural Science Foundation of China (No40701142)the Scientific Research Starting Foundation for Returned Overseas Chinese Scholars, Ministry of Education, China
文摘The paper proposes an economical and fast algorithm for deriving trajectories from sporadic tracking points collected in location-based services (LBS). Although many traffic studies or applications can benefit from the derived trajectories, the sporadic tracking points are always implicitly overlooked by most of existing map-matching algorithms. The algorithm proposed in this paper finds network paths or trajectories traveled by vehicles through augmenting GPS data with odometer data. An odometer can provide data of traveled distance which are compared with the lengths of candidate network paths in order to find the most approximate network path approaching the trajectory of a vehicle. Tracking points are classified into anchor points and non-anchor points. The former are used to divide trajectories, and the latter screen candidate network paths. An elliptic selection zone and a reduction process are applied to the selection of possible road segments composing candidate network paths. A brute-force searching algorithm is developed to find candidate network paths and calculate their lengths. A two-step screening process is designed to select the final result from candidate network paths. Finally, a series of experiments are conducted to validate the proposed algorithm.