Filippova Automated planning of graduality assembly

Modern industrial production requires the improvement of assembly processes, and thus increase the level of automated intelligent sequence planning. Therefore, researches in the field of automation of the sequence of assembly of products in industries are relevant at this time. In today's world there is a need to develop complex, accurate products. Problems are created in industries due to the reduction of the life cycle of products. There is a need to study the problem of assembly planning to achieve the goal of practical implementation and standardization of assembly plans. Creating graphs of the addition process is one of the problems. The assembly planning system can reduce human intervention in the process and reduce computational effort. The finished assembly contains many components that can be assembled using many sequences. A review of the methods from the literature showed that although these methods increase the automation level, they still cannot be applied to actual production because they do not take into account the experience and knowledge that can play a major role in planning and are of great value. Assembly planning, relationship charts, priority charts. Improving the assembly planning system to create a communication schedule and an assembly priority schedule was proposed. The advanced system will be used to generate possible assembly sequences with subassembly identification. A system has been developed to create alternative possible assembly sequences that can be used by component part / product designers in the early stages. A system capable of generating assembly sequences for simultaneous assembly of multiple parts has been proposed. Conclusions and work results can be applied used and improved for more productive product development by designers in the early stages and faster assembly of products in enterprises. The paper did not consider practical limitations (gravity) and irreversible assembly operations, such as permanent fastening, welding etc. Кey words: assembly, blocking graph, relation graph, sequence

Communication Planning for Cooperative Terrain-Based Underwater Localization

This paper presents a decentralized communication planning algorithm for cooperative terrain-based navigation (dec-TBN) with autonomous underwater vehicles. The proposed algorithm uses forward simulation to approximate the value of communicating at each time step. The simulations are used to build a directed acyclic graph that can be searched to provide a minimum cost communication schedule. Simulations and field trials are used to validate the algorithm. The simulations use a real-world bathymetry map from Lake Nighthorse, CO, and a sensor model derived from an Ocean Server Iver2 vehicle. The simulation results show that the algorithm finds a communication schedule that reduces communication bandwidth by 86% and improves robot localization by up to 27% compared to non-cooperative terrain-based navigation. Field trials were conducted in Foster Reservoir, OR, using two Riptide Autonomous Solutions micro-unmanned underwater vehicles. The vehicles collected GPS, altimeter, acoustic communications, and dead reckoning data while following paths on the surface of the reservoir. The data were used to evaluate the planning algorithm. In three of four missions, the planning algorithm improved dec-TBN localization while reducing acoustic communication bandwidth by 56%. In the fourth mission, dec-TBN performed better when using full communications bandwidth, but the communication policy for that mission maintained 86% of the localization accuracy while using 9% of the communications. These results indicate that the presented communication planning algorithm can maintain or improve dec-TBN accuracy while reducing the number of communications used for localization.

Reducing communication in algebraic multigrid with multi-step node aware communication

Algebraic multigrid (AMG) is often viewed as a scalable [Formula: see text] solver for sparse linear systems. Yet, AMG lacks parallel scalability due to increasingly large costs associated with communication, both in the initial construction of a multigrid hierarchy and in the iterative solve phase. This work introduces a parallel implementation of AMG that reduces the cost of communication, yielding improved parallel scalability. It is common in Message Passing Interface (MPI), particularly in the MPI-everywhere approach, to arrange inter-process communication, so that communication is transported regardless of the location of the send and receive processes. Performance tests show notable differences in the cost of intra- and internode communication, motivating a restructuring of communication. In this case, the communication schedule takes advantage of the less costly intra-node communication, reducing both the number and the size of internode messages. Node-centric communication extends to the range of components in both the setup and solve phase of AMG, yielding an increase in the weak and strong scaling of the entire method.

Methods for Large-Scale Time-Triggered Network Scheduling

Future cyber–physical systems may extend over broad geographical areas, like cities or regions, thus, requiring the deployment of large real-time networks. A strategy to guarantee predictable communication over such networks is to synthesize an offline time-triggered communication schedule. However, this synthesis problem is computationally hard (NP-complete), and existing approaches do not scale satisfactorily to the required network sizes. This article presents a segmented offline synthesis method which substantially reduces this limitation, being able to generate time-triggered schedules for large hybrid (wired and wireless) networks. We also present a series of algorithms and optimizations that increase the performance and compactness of the obtained schedules while solving some of the problems inherent to segmented approaches. We evaluate our approach on a set of realistic large-size multi-hop networks, significantly larger than those considered in the existing literature. The results show that our segmentation reduces the synthesis time by up to two orders of magnitude.

Methods for Large-Scale Time-Triggered Network Scheduling

Future cyber-physical systems may extend over broad geographical areas, like cities or regions, thus requiring the deployment of large real-time networks. A strategy to guarantee predictable communication over such networks is to synthesize an offline time-triggered communication schedule. However, this synthesis problem is computationally hard (NP-complete), and existing approaches do not scale satisfactorily to the required network sizes. This article presents a segmented offline synthesis method which substantially reduces this limitation, being able to generate time-triggered schedules for large hybrid (wired and wireless) networks. We also present a series of algorithms and optimizations that increase the performance and compactness of the obtained schedules while solving some of the problems inherent to segmented approaches. We evaluate our approach on a set of realistic large-size multi-hop networks, significantly larger than those considered in the existing literature. The results show that our segmentation reduces the synthesis time up to two orders of magnitude.

FlexRay Network Development Based on Network Designer and Rapid Control Prototyping

Network Designer, which is suitable for the CAN, LIN and FlexRay design, is used to design the database of FlexRay according to the actual requirements, including the definition of nodes, messages and signals of FlexRay cluster and the design of communication schedule. And The Network Designer is able to export FIBEX. Import the database file which was well designed to the FlexRay Configuration Tool, then configurate the corresponding parameters of the software and combine it with MATLAB/Simulink to create RTIFlexRayConfig model. MicroAutoBox which is a tool of rapid control prototyping and Simulator which is a tool of hardwarein-the-loop simulation are used as two nodes of FlexRay to verify network performance by transmitting drivers input signals.