This paper considers the problem faced by a group of evacuees must leave from an affected area as quickly possible.We seek efficient tactics that achieve bounded ratio evacuation time without boundary information to with.Specially, can communicate with each other during evacuation.In this paper, we restrict convex region in plane.We analyze two scenarios: general plane and grid network.In these scenarios, present new evacuate tactics, respectively.

In this study, we developed a snake robot that goes through branch point on exterior of pipe in helical shape. A hyperbolic function is utilised to generate wave along the curve. The joint angles are derived by calculating curvature and torsion curve using formula continuous model. We implemented new motion real considering parameters addition, propose method compensate for effect gravity achieve robot. Experimental results shown validate effectiveness proposed method.

In this paper, we discuss the characteristics of developing robot instruction in pre-primary education, primary secondary university education and its impact on educational informatization, application "Robot Assisted Instruction" all kinds colleges at levels has also been discussed. Through above explanations, can easily realize that interactive ability based traditional computer is extended, more function added range expanded.

The issue of achieving an appropriate segmentation for indoor point cloud scenes remains difficult. Although available methods continue to improve the benchmark performance, more attentions need be paid deal with drawbacks inaccurate or incomplete segments in division. To push research next level, this work proposes learning-free algorithm clouds which consists two stages. first stage extracts edges RGBD and applies them voxel clustering process avoid generating supervoxels are situated...

In recent years, numerous Transformer-based models have been applied to long-term time-series forecasting (LTSF) tasks. However, studies with linear questioned their effectiveness, demonstrating that simple layers can outperform sophisticated models. this work, we review and categorize existing into two main types: (1) modifications the model structure (2) input data. The former offers scalability but falls short in capturing inter-sequential information, while latter preprocesses data is...

We consider the problem of evacuating some people from an unknown convex region. The do neither have information about region boundary nor their positions. seek competitive strategy that achieves a ratio evacuation path over shortest path. In scenario general plane, we propose SOP for one group, and prove its is 19.64. And 14.37-competitive STP two groups. Also, present efficient strategies in grid network. Furthermore, our can be used guiding robot to search

This article presents efficient strategies for evacuating from an unknown affected area in a plane. Evacuation is the process of movement away threat or hazard such as natural disasters. Consider that one n(n ≥ 3) agents are lost convex region P. The know neither boundary information P nor their positions. We seek competitive can evacuate agent quickly possible. performance strategy measured by ratio evacuation path over shortest path. give 13.812-competitive spiral agent, and prove it...

Let s and t be two points in the plane, how to compute Euclidean shortest path between which visits a sequence of segments given is problem discussed this paper, especially, situation adjacent intersect focus our study.In we first analyze degeneration applying rubber-band algorithm solve introduce for computing with removing sufficiently small segments.Then based on algorithm, present new solving ESP by crossing over deal intersection order can changed when they intersect.Furthermore, have...

Given a start point s, target t, and sequence of k disjoint convex polygons in the plane, finding shortest path from s to t which visits each polygon given order is our focus.In this paper, we present an improved method compute based on last step maps by Dror et al.Instead using location previous algorithm, propose efficient locating points with linear query make data structures much simpler.Our algorithm gives O(nk) running time improves upon O(nklog(n/k)) etal., where n total number...

In this paper, a slicing method for AMF model is proposed. This combines region growing surface reconstruction with topology structure model. We perform half-edge match in the process to obtain of triangular mesh Then, relation between adjacent facets preserved an file which extensible, and based on these information accomplished. Our integrates 3D printing reconstruction, reducing deviation brought by step-by-step operations. Compared approaches STL files, experiments show that our improves...

Automatic 3-D unorganized point data registration technique,which maps datas measured from multiple viewpoints into a common coordinate space, is key technique for reverse engineering.In order to improve matching speed, parallel detecting algorithm with local geometric feature based on CUDA architechure was proposed.Firstly,local points were extracted original sets,and then the correspondence between them are computed, at last this implemented in pattern CUDA.The comparison experiments show...

The variable geomagnetic field contains a variety of components from various sources. It has different variation characteristics at each time scale. In this paper, method modeling and forecasting the multiple scales is presented. Firstly, we develop magnetic trend model day scale, daily hour short period minute respectively. Then, combine scale to realize field. combines physical origin fuses models obtain both long span high precision.

This paper studies a searching problem in an unknown street. A simple polygon [Formula: see text] with two distinguished vertices, and text], is called street if the boundary chains from to are mutually weakly visible. We use mobile robot locate starting text]. Assume that has limited sensing capability can only detect constructed edges (also gaps) on of its visible region, but cannot measure any angle or distance. The does not have knowledge advance. present new competitive strategy for...

We investigate an online problem of a robot exploring the outer boundary unknown simple polygon P. The starts from specified vertex s and walks exploration tour outside It has to see all points polygon's return start. provide lower upper bounds on ratio distance traveled by in comparison length shortest path. consider P two scenarios: convex concave polygon. For first scenario, we prove bound 5 propose 23.78-competitive strategy. second 5.03 26.5-competitive

Due to the lack of effective modeling and analysis methods for testability complex electronic system, a index model is established resolve this problem. First all, existing demonstration test evaluation method are analyzed. On basis, indexes statistical models based on binomial distribution, or Beta distribution F established. What’s more, relationship principle between fault detection isolation data confidence level analyzed in these models. Finally, result simulation shows that practical...

Let s and t be two points on the boundary of a simple polygon, how to compute Euclidean shortest path between which visits sequence segments given in polygon is problem discussed, especially, situation adjacent intersect focus our study. In this paper, we first analyze degeneration applying rubber-band algorithm solve problem. Then based algorithm, present an improved can by method crossing over deal with intersection order changed when they intersect. Particularly, have implemented applied...