No abstract

No abstract

No abstract

No abstract

No abstract

A timed Petri net (TPN) has been widely used for modeling, scheduling, and analyzing discrete event dynamic systems. This study examines cyclic scheduling problems of a TPN to minimize the cycle time especially for automated manufacturing systems. Appropriate token routing at each conflict place can make a TPN repeat an identical firing sequence. We propose a systematic procedure to transform a TPN with such cyclic token routing into an equivalent timed event graph (TEG) for which the cycle time and firing schedules can be evaluated by a linear programming (LP). Based on the transformation procedure, we develop an efficient branch and bound algorithm to solve the scheduling problem. A partial solution is defined as a partial token route that has only a subset of token routes for determining the complete schedule. The lower bound of a partial solution is determined by the cycle time of a TEG that has the partial token route. The cycle time of a TEG with an additional token route for a new partial solution is computed by a dual-simplex algorithm which avoids solving the LP completely again. A dynamic branching strategy that prevents unnecessary branching for the scheduling decision is also proposed. We demonstrate the computational efficiency through intensive experiments of cluster tools and robotic flow shops.Note to Practitioners-There are many systems which repeat an identical task sequence such as manufacturing systems, transportation systems, and robotic systems. Maximizing the throughput of such a system by optimizing the cyclic task sequence, which is called a cyclic scheduling problem, has been an important problem. In order to deal with cyclic scheduling problems, this paper uses a timed Petri net (TPN) which is a graphical modeling tool for discrete event dynamic systems. As the size of a TPN model increases, the computational complexity of the cyclic scheduling problem exponentially increases due to the combinatorial nature of sequencing problems. Therefore, an efficient algorithm for optimal cyclic scheduling of TPNs is needed. This study proposes an efficient branch and bound algorithm which is a kind of a tree search algorithm. Several important techniques are developed. First, a transformation procedure from a TPN to a timed event graph is developed. Second, an efficient branching rule which reduces the size of the search tree is proposed. Third, the lower bound which evaluates the cycle time of each node in the search tree is suggested. We verify the efficiency of the algorithm Manuscript through the experiments on manufacturing systems such as a cluster tool and a robotic flow shop.Index Terms-Branch and bound algorithm, cluster tool, cyclic scheduling, timed event graph (TEG), timed Petri net (TPN). 1545-5955 © 2013 IEEE

ObjectivesWe compared resorbable plates with titanium plates for treatment of combined mandibular angle and symphyseal fractures.Materials and MethodsPatients with mandibular angle and symphysis fractures were divided into two groups. The control (T) group received titanium plates while the experimental (R) group received resorbable plates. All procedures were carried out under general anesthesia using standard surgical techniques. We compared the frequency of wound dehiscence, development of infection, malocclusion, malunion, screw breakage, and any other technical difficulties between the two groups.ResultsThirteen patients were included in the R group, where 39 resorbable plates were applied. The T group consisted of 16 patients who received 48 titanium plates. The mean age in the R and T groups was 28.29 and 24.23 years, respectively. Primary healing of the fractured mandible was obtained in all patients in both groups. Postoperative complications were minor and transient. Moreover, there were no significant differences in the rates of various complications between the two groups. Breakage of 3 screws during the perioperative period was seen in the R group, while no screws or plates were broken in the T group.ConclusionResorbable plates can be used to stabilize combined mandibular angle and symphysis fractures.

In recent years, research concerning autonomous driving has gained momentum to enhance road safety and traffic efficiency. Relevant concepts are being applied to the fields of perception, planning, and control of automated vehicles to leverage the advantages offered by the vehicle-to-everything (V2X) communication technology. This paper presents a V2X communication-aided autonomous driving system for vehicles. It is comprised of three subsystems: beyond line-of-sight (BLOS) perception, extended planning, and control. Specifically, the BLOS perception subsystem facilitates unlimited LOS environmental perception through data fusion between local perception using on-board sensors and communication perception via V2X. In the extended planning subsystem, various algorithms are presented regarding the route, velocity, and behavior planning to reflect real-time traffic information obtained utilizing V2X communication. To verify the results, the proposed system was integrated into a full-scale vehicle that participated in the 2019 Hyundai Autonomous Vehicle Competition held in K-city with the V2X infrastructure. Using the proposed system, the authors demonstrated successful completion of all assigned real-life-based missions, including emergency braking caused by a jaywalker, detouring around a construction site ahead, complying with traffic signals, collision avoidance, and yielding the ego-lane for an emergency vehicle. The findings of this study demonstrated the possibility of several potential applications of V2X communication with regard to autonomous driving systems.