The ability to extract state-estimates for each target of a multi-target posterior, referred to as multi-estimate extraction(MEE), is an essential requirement for a multi-target filter, whose key performance assessmen...The ability to extract state-estimates for each target of a multi-target posterior, referred to as multi-estimate extraction(MEE), is an essential requirement for a multi-target filter, whose key performance assessments are based on accuracy, computational efficiency and reliability. The probability hypothesis density(PHD) filter, implemented by the sequential Monte Carlo approach,affords a computationally efficient solution to general multi-target filtering for a time-varying number of targets, but leaves no clue for optimal MEE. In this paper, new data association techniques are proposed to distinguish real measurements of targets from clutter, as well as to associate particles with measurements. The MEE problem is then formulated as a family of parallel singleestimate extraction problems, facilitating the use of the classic expected a posteriori(EAP) estimator, namely the multi-EAP(MEAP) estimator. The resulting MEAP estimator is free of iterative clustering computation, computes quickly and yields accurate and reliable estimates. Typical simulation scenarios are employed to demonstrate the superiority of the MEAP estimator over existing methods in terms of faster processing speed and better estimation accuracy.展开更多
Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is prop...Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is proposed so that JSP-DCPT can be handled by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoff problems. To simplify the decomposition approach, the time-cost phase plane is introduced to describe tradeoffs of the discrete time-cost tradeoff problem, and an extreme mode-based set dominant theory is elaborated so that an upper bound is determined to cut discrete time-cost tradeoff problems generated by using the proposed decomposition approach. An extreme mode-based set dominant decomposition algorithm (EMSDDA) is then proposed. Experimental simulations for instance JSPDCPT_FT10, which is designed based on a JSP benchmark FT10, demonstrate the effectiveness of the proposed theory and the decomposition approach.展开更多
基金partly supported by the Marie SklodowskaCurie Individual Fellowship (No. 709267)under the European Union’s Framework Programme for ResearchInnovation Horizon 2020 and National Natural Science Foundation of China (No. 51475383)
文摘The ability to extract state-estimates for each target of a multi-target posterior, referred to as multi-estimate extraction(MEE), is an essential requirement for a multi-target filter, whose key performance assessments are based on accuracy, computational efficiency and reliability. The probability hypothesis density(PHD) filter, implemented by the sequential Monte Carlo approach,affords a computationally efficient solution to general multi-target filtering for a time-varying number of targets, but leaves no clue for optimal MEE. In this paper, new data association techniques are proposed to distinguish real measurements of targets from clutter, as well as to associate particles with measurements. The MEE problem is then formulated as a family of parallel singleestimate extraction problems, facilitating the use of the classic expected a posteriori(EAP) estimator, namely the multi-EAP(MEAP) estimator. The resulting MEAP estimator is free of iterative clustering computation, computes quickly and yields accurate and reliable estimates. Typical simulation scenarios are employed to demonstrate the superiority of the MEAP estimator over existing methods in terms of faster processing speed and better estimation accuracy.
基金supported by the National Natural Science Foundation of China (Grant Nos. 51075337, 50705076, 50705077)the Natural Sci-ence Basic Research Plan in Shaanxi Province of China (Grant No. 2009JQ9002)
文摘Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is proposed so that JSP-DCPT can be handled by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoff problems. To simplify the decomposition approach, the time-cost phase plane is introduced to describe tradeoffs of the discrete time-cost tradeoff problem, and an extreme mode-based set dominant theory is elaborated so that an upper bound is determined to cut discrete time-cost tradeoff problems generated by using the proposed decomposition approach. An extreme mode-based set dominant decomposition algorithm (EMSDDA) is then proposed. Experimental simulations for instance JSPDCPT_FT10, which is designed based on a JSP benchmark FT10, demonstrate the effectiveness of the proposed theory and the decomposition approach.