Curvature-constrained path elongation with expected length for Dubins vehicle

Automatica ◽  
2019 ◽  
Vol 108 ◽  
pp. 108495 ◽  
Author(s):  
Yulong Ding ◽  
Bin Xin ◽  
Jie Chen
Keyword(s):  
Dubins Vehicle ◽  
Expected Length

Development and Application of a New PCR Method for Detection of Blumeria graminis f. sp. tritici

2018 ◽  
Vol 28 (3) ◽  
pp. 137-146 ◽  
Author(s):  
Adam Kuzdraliński ◽  
Hubert Szczerba ◽  
Anna Kot ◽  
Agnieszka Ostrowska ◽  
Michał Nowak ◽  
...  
Keyword(s):  
Dna Sequences ◽  
Puccinia Triticina ◽  
Blumeria Graminis ◽  
Pyrenophora Tritici Repentis ◽  
Field Samples ◽  
Expected Length ◽  
Pcr Assays ◽  
Primer Sets ◽  
Wheat Leaves ◽  
Species Specific

We developed new PCR assays that target beta-tubulin (<i>TUB2</i>) and 14 alpha-demethylase (<i>CYP51</i>) genes and used them for the species-specific detection of <i>Blumeria graminis</i> f. sp. <i>tritici</i> (<i>Bgt</i>). Based on fungi DNA sequences available in the NCBI (National Center for Biotechnology Information) GenBank database we developed simplex and duplex PCR assays. The specificities of the primer sets were evaluated using environmental samples of wheat leaves collected during the 2015/2016 growing season across Poland. Primer sets<i></i> LidBg17/18 and LidBg21/22 strongly amplified fragments of the expected length for all 67 tested samples. Primer specificity was confirmed using field samples of <i>Zymoseptoria tri­tici</i>, <i>Puccinia triticina</i> (syn.<i> P. recondita</i> f. sp.<i> tritici</i>), <i>P. striiformis</i> f. sp.<i> tritici</i>, and <i>Pyrenophora tritici-repentis</i>.

scholarly journals ON SAMPLING BASED METHODS FOR THE DUBINS TRAVELING SALESMAN PROBLEM WITH NEIGHBORHOODS

2015 ◽  
Vol 2 (2) ◽  
pp. 57-61
Author(s):  
Petr Váňa ◽  
Jan Faigl
Keyword(s):  
Path Planning ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Computational Time ◽  
Solution Quality ◽  
Goal Region ◽  
Dubins Vehicle ◽  
Proposed Modification ◽  
Dubins Traveling Salesman Problem

In this paper, we address the problem of path planning to visit a set of regions by Dubins vehicle, which is also known as the Dubins Traveling Salesman Problem Neighborhoods (DTSPN). We propose a modification of the existing sampling-based approach to determine increasing number of samples per goal region and thus improve the solution quality if a more computational time is available. The proposed modification of the sampling-based algorithm has been compared with performance of existing approaches for the DTSPN and results of the quality of the found solutions and the required computational time are presented in the paper.

scholarly journals Improved Performance of Asymptotically Optimal Rapidly Exploring Random Trees

2018 ◽  
Vol 141 (1) ◽  
Author(s):  
Beth Boardman ◽  
Troy Harden ◽  
Sonia Martínez
Keyword(s):  
Degrees Of Freedom ◽  
Metric Spaces ◽  
Dynamic Environments ◽  
Random Trees ◽  
Asymptotically Optimal ◽  
Euclidean Metric ◽  
The Third ◽  
Dubins Vehicle ◽  
Improved Performance ◽  
Dubins Vehicles

Three algorithms that improve the performance of the asymptotically optimal Rapidly exploring Random Tree (RRT*) are presented in this paper. First, we introduce the Goal Tree (GT) algorithm for motion planning in dynamic environments where unexpected obstacles appear sporadically. The GT reuses the previous RRT* by pruning the affected area and then extending the tree by drawing samples from a shadow set. The shadow is the subset of the free configuration space containing all configurations that have geodesics ending at the goal and are in conflict with the new obstacle. Smaller, well defined, sampling regions are considered for Euclidean metric spaces and Dubins' vehicles. Next, the Focused-Refinement (FR) algorithm, which samples with some probability around the first path found by an RRT*, is defined. The third improvement is the Grandparent-Connection (GP) algorithm, which attempts to connect an added vertex directly to its grandparent vertex instead of parent. The GT and GP algorithms are both proven to be asymptotically optimal. Finally, the three algorithms are simulated and compared for a Euclidean metric robot, a Dubins' vehicle, and a seven degrees-of-freedom manipulator.

Ứng dụng Lean Six Sigma cho quy trình khám chữa bệnh ngoại trú có BHYT tại một số bệnh viện thành phố Hồ Chí Minh

2021 ◽  
Vol 05 (01) ◽  
pp. 84-94
Author(s):  
Van Dat Truong ◽  
◽  
Thi Hong An Hua ◽  
Dang Tu Nguyen Le ◽  
Thi Hai Yen Nguyen
Keyword(s):  
Patient Satisfaction ◽  
Health Insurance ◽  
Six Sigma ◽  
Sigma Model ◽  
Lean Six Sigma ◽  
Health Staff ◽  
Outpatient Services ◽  
Staff Members ◽  
Expected Length ◽  
Screening Procedures

Objects: Evaluate the current state of the quality of insured outpatient services (clinical time, patient satisfaction) and evaluate the effectiveness of the LSS improvement in some steps in the process. Methods: Lean Six Sigma applied research is conducted through five steps: Define-Measure-Analyze-Improve-Control from March 2017 to June 2017 in the outpatient care with health insurance in some Ho Chi Minh city hospitals. A survey on 166 outpatients with health insurance was conducted by direct interviews of pre- and post-admission and in consultation with 10 health staff members. Result: 32 causes of ineffective activities were identified in two screening procedures. Then corrective measures were suggested. The goal of improving survey process timing and patient satisfaction is 20%. After improvements in the Lean Six Sigma model, positive results on the timing of the two procedures were obtained, including the expected length of the registration process (<40 minutes) was improved by 13.8%, the expected length of dosage regimen (<20 minutes) was improved by 22.9%, and the satisfaction level of patients was improved by 11.5%. Conclusion: The Lean Six Sigma model is valued for identifying root causes for non-performance activities in the two above-mentioned screening procedures. It is recommended to apply this model to other procedures and other departments in the hospital, to propose remedies or eliminations from the process based on identified causes. Keyword: Lean, process of outpatients treatment

Analysis of a Discrete-Time Geo/G/1 Queue in a Multi-Phase Service Environment with Disasters

2018 ◽  
Vol 6 (4) ◽  
pp. 349-365
Author(s):  
Tao Jiang
Keyword(s):  
Generating Function ◽  
Discrete Time ◽  
Queueing System ◽  
Supplementary Variable ◽  
Variable Technique ◽  
Service Environment ◽  
Stationary Queue Length ◽  
Expected Length ◽  
Multi Phase ◽  
The Relationship

Abstract This paper considers a discrete-time Geo/G/1 queue in a multi-phase service environment, where the system is subject to disastrous breakdowns, causing all present customers to leave the system simultaneously. At a failure epoch, the server abandons the service and the system undergoes a repair period. After the system is repaired, it jumps to operative phase i with probability qi, i = 1, 2 ⋯, n. Using the supplementary variable technique, we obtain the distribution for the stationary queue length at the arbitrary epoch, which are then used for the computation of other performance measures. In addition, we derive the expected length of a cycle time, the generating function of the sojourn time of an arbitrary customer, and the generating function of the server’s working time in a cycle. We also give the relationship between the discrete-time queueing system to its continuous-time counterpart. Finally, some examples and numerical results are presented.

Sign in / Sign up

Export Citation Format

Share Document