441results about How to "Improve planning efficiency" patented technology

A path planning method for avoiding of traffic hotspots helps to realize an intelligent path planning method with a purpose of the shortest journey time, by dynamical planning of paths with an avoiding property, based on a destination where a driving user goes. The traffic hotspot information, such as large-scale activities, traffic accidents, traffic-peak block roads, school time or commuter time of large-scale units, weather information and the like, are mined continually from a plurality of data sources comprising webpages, microblogs, real-time reported traffic information, historical regularity information and the like. By acquisition of the traffic hotspot information in real time, and combination with influences of a road maximum speed limit, road width and traffic light delay at intersections to driving as well as whether a main road containing a non-motor vehicle zone, a rapid navigation route with an avoiding function is planed, and also a dynamic path planning can be carried out in real time base on a current position. The method helps to provide a fastest path to the destination for drivers and alleviate city traffic jam in certain degree.

An autonomous obstacle-avoiding planning method of a tour detector based on a binocular stereo vision is characterized by: generating DEM data of a local topography; constructing a raster map of a field range of a binocular stereo vision system, carrying out DEM data statistics to each grid in the map and carrying out de-noising processing to the DEM; carrying out topography traversability analysis so as to generate a suitability map; using the suitability maps generated during back and forth two planning to carry out data fusion and obtaining the fused suitability map which is used in the obstacle-avoiding planning; placing several alternative path arcs on the suitability map; evaluating the each alternative path arc from two aspects of a distance from the alternative path arc to a target point and a safe obstacle-avoiding ability; selecting the alternative path arcs whose evaluation values are higher a setting threshold from all the alternative path arcs and selecting the path arc who has the highest evaluation value as a result of the obstacle-avoiding planning. The method of the invention is simple and complete. Security is high. Planning efficiency is high. Engineering realization is easy to be achieved. The method can be used to perform a tour detection task of a complex terrain.

The invention relates to a redundant robot dynamic obstacle avoidance route planning method using a pre-selected minimum distance index under an obstacle random motion environment. The method includes steps of using an oriented bounding box (OBB) to model a redundant robot and establishing the pre-selected minimum distance index; rejecting safe rod pieces through an intersection testing before a real-time distance is calculated; using a local mapping distance calculation method and target point coordinate values to directly obtain a real-time minimum distance and determining impact point positions in a local coordinate system of corresponding rod pieces; and on this basis, establishing obstacle avoidance gains and escape velocities relevant to the minimum distance and using a null space mapping matrix of the redundant robot to plan obstacle avoidance routes. According to the redundant robot dynamic obstacle avoidance route planning method, the safe rod pieces are rejected before dynamic obstacle avoidance planning, unnecessary trivial calculations are removed, a distance calculation method is optimized, planning efficiencies of dynamic obstacle avoidance are improved, and real-time requirements are met.

The invention discloses a simultaneous positioning and mixed map construction method for a dynamic parking environment. By introducing environmental semantic information for data association, a dynamic target in a feature point map for realizing positioning is removed, and meanwhile, static state semantic information such as parking spots is introduced during the positioning, so that the positioning precision in the dynamic environment is improved; a full-view stereoscopic vision platform is taken as a unique environmental perception source of the system and is combined with the advantages offull-view cameras and vision, so that the environmentally accurate dimension information is realized; meanwhile, the view is wide, and the standing time of feature points in the map is long, so that the positioning precision can be increased; and the semantic information such as the parking spots can be fused with a topologic road network structure in the environment, so that the route planning efficiency can be effectively improved, and the instantaneity of an autonomous parking system is further improved.

The invention provides a method for distributing satellite receiving tasks. The method comprises the steps of decomposing the satellite receiving task planning problem by the divide-and-conquer method; decomposing the satellite data receiving task problem under a large task quantity into a plurality of sub-problems under a small task quantity; optimally configuring a ground receiving resource of each satellite data receiving task of each conflict task set by the genetic algorithm by considering the satellite-earth resource limitation, so as to reach the purpose of fully utilizing the ground receiving resource. According to the method, the parallel strategy of dividing and conquering is carried out to greatly increase the satellite receiving task planning efficiency; in addition, the genetic algorithm is performed for the satellite receiving task planning problem under each small task quantity, and therefore, the ground receiving resource is quickly and fully distributed, and the optimal satellite receiving task planning scheme can be obtained. According to the method, the automatic mode is performed, so that the brain power of operators can be relieved, and the planning efficiency and the capacity of responding to the emergency task can be greatly increased.

The invention discloses a pipeline planning method and device based on data driven modeling and simulation optimization, and belongs to the field of production line planning and design. The method comprises a step of performing rapid analysis on each data of an assembly line based on data driving and building a data model, a step of building a simulation model based on the data model through hierarchical modeling and driving the simulation model to run, outputting an simulation result and evaluating a result according to set indicators, continuously optimizing and improving the unreasonable allocation of device resources, and quickly performing reasonable pipeline planning and design. According to the invention, the model is quickly established through data driving, the model has good flexibility and reusability, the simulation model can be driven by modifying external data to run different simulation tests, the flexibility, versatility and portability of the simulation model are enhanced, the planning efficiency is improved, and the efficiency is improved and the correctness is ensured on the basis of automatic rapid modeling.

The invention discloses a multi-AGV-guiding and dynamic path planning method. The multi-AGV-guiding and dynamic path planning method comprises the following four steps: step one, division of nodes and lines of a movement region; step two, design of an AGV-guiding scheme; step three, design of a competitive mode of motion nodes of AGV; and step four, path planning of the AGV. The invention aims to provide a scheme capable of realizing multi-AGV motion line guiding and dynamic path planning to guarantee that a plurality of AGVs moving in the same region can effectively arrive at target locations, and are prevented from colliding with other AGVs.

The invention discloses a dynamic path planning method of a robot by combining an A* algorithm and a VFH obstacle avoiding algorithm. The method comprises steps of representing the environment where the robot is located into a grid map and searching a global initial path in a grid map by use of the A* algorithm; when the robot moves towards a target point along the initial path, judging whether the robot comes across an obstacle, if yes, using the VFH algorithm to carry out obstacle avoidance, or else allowing the robot to move towards the target point; during obstacle avoidance, firstly, setting a stage target point in the initial path, generating an obstacle avoiding path between the current position and the stage target point, moving for one step forwards, updating the current position,judging whether the space between the current position of the robot and the stage target point is shielded, if yes, re-calculating the obstacle avoiding path, or else, allowing the robot to move forone step forwards towards the stage target point along the obstacle avoiding path; and carrying out circulation until the robot reaches the stage target point, returns back to the initial path and continues to move towards a destination. By combining the two algorithms, efficiency of path planning of the robot is improved; and the autonomous navigation ability of the robot in the indoor dynamic environment is ensured.

The invention provides a global-local hybrid unmanned ship path planning method based on dynamic constraints. The global-local hybrid unmanned ship path planning method comprises the steps of: S1, constructing an unmanned ship kinematics model, and conducting kinetic analysis; S2, considering a safety range of an unmanned ship, realizing the planning of a global path of the unmanned ship by adopting a storage node mode, and constraining the safe driving of the unmanned ship by optimizing the generated path points; S3, for a dynamic unpredictable environment, constructing a hierarchical structure based on an FDM fuzzy decision module and an FDW precise dynamic window module, and realizing the planning of a local path of the unmanned ship, precisely taking drivable forward, heading angular velocities and acceleration into account in the planning of the local path, and generating a traceable path that enables real-time local collision avoidance; S4, and fusing a global path planning scheme and a local path planning scheme of the unmanned ship to form a global-local hybrid obstacle avoidance strategy. According to the global-local hybrid unmanned ship path planning method, virtual pathpoints are inserted into the global optimal path, so that global and local path planning is perfectly combined, and the whole path tracking task is completed.

The invention discloses a method and system for supporting an urban land utilization and traffic integrated planning policy. The method comprises the following steps of: S1, constructing a land utilization model; S2, constructing a traffic planning demand predicting model; S3, judging a convergence property of a traffic accessibility value according to a traffic accessibility value result and an accessibility convergence index obtained according to the traffic planning demand predicting model, if a result indicates no convergence, executing an S4, and if the result indicates convergence, executing an S5; S4, feeding a result of the traffic planning demand predicting model back to the land utilization model, and returning to the S1 to restart a model computing process; and S5, stopping a cyclic feedback process, meanwhile, evaluating results of each land utilization scheme and each traffic planning scheme in real time when the cyclic feedback process is stopped, and selecting a preferential land utilization and traffic planning scheme. According to the invention, the urban land utilization and traffic planning can be realized automatically according to basic data, and the planning efficiency and the reasonableness, the scientificity and the continuity for planning can be improved.

The present invention provides a dynamic path planning method, device and system, and a storage medium. The method comprises the following steps: determining, in a high-level grid map, at least one initial candidate path according to locations of a start point and an end point; obtaining a grid where the initial candidate path passes in the high-level grid map as a path grid; acquiring a low-levelgrid map corresponding to the path grid; optimizing the initial candidate path according to the low-level grid map to acquire a target candidate path. The dynamic path planning method can reduce processed data of path planning to improve the planning efficiency, and adopts a boundary node according to a dynamic traffic state to improve the accuracy and reasonability of the path planning.

The invention discloses an automatic operation management method for a large-scale low-orbit satellite constellation operation control system, and relates to the field of automatic control. Starting from various functions of a satellite ground operation and control system, dynamic generation of various events in satellite operation and control management is analyzed, and a real-time decision and task driving mechanism adapting to satellite complex task operation is studied in combination with operation management events. Meanwhile, conflict resolution under large-scale constellation and multi-task parallelism is comprehensively considered from the top layer design; a satellite operation management expert system is constructed, automatic identification and analysis of satellite-ground resource state monitoring information are realized, and a prediction means of a key parameter change trend is provided through combined reasoning of a current state and historical data; aiming at possiblefaults in a satellite-ground resource operation period, a fault knowledge base and an inference tool which are graded and planned are constructed, abnormity can be analyzed and judged at the first time, fault positioning can be performed and a feasible plan can be given after a system prompts and gives an alarm, and efficient service is provided for troubleshooting.

The invention relates to a route planning method and a route planning system which are applied to plant protection of an unmanned aerial vehicle. The method comprises the steps of judging whether the polygon of a plot is a convex polygon; calculating the narrowest strip of the convex polygon so as to determine a starting edge if the polygon of the plot is the convex polygon; otherwise, determining the starting edge according to the perpendicular direction of the sunk interval of the polygon of the plot and the length of each edge of the polygon of the plot; calculating a route according to the starting edge. According to the route planning method and the route planning system, the optimal starting edge and the optimal route can be automatically calculated according to the shape of the plot, so that the route planning efficiency and quality are increased; in addition, the actual demand of a concave polygon is considered in a route planning process, so that the route is prevented from passing through the boundary of the plot so as not to pass through exterior areas of the plot.

The invention provides a two-dimensional route planning method for a UUV to geometrically bypass circular barriers. The method comprises the following steps: 1, reading a route origin Ob, a route terminal point Oe and parameters of each circular barrier from a mission text; 2, performing expansion processing on each circular barrier, and calculating the parameters of each circular barrier after expansion; 3, establishing a bypassing point set S, making a planning current point Oc to be a starting point Ob, and placing the starting point in the bypassing point set S; 4, if the planning current point Oc is the route terminal point Oe, or the planning current point Oc and the route terminal point O2 are visual, skipping to the sixth step, and otherwise, executing the fifth step; 5, performing geometric bypassing on a circular barrier closest to the planning current point Oc, obtaining a bypassing point, placing the bypassing point in the bypassing point set S, updating the planning current point Oc, and skipping to the fourth step; and 6, placing the route terminal point Oe in the bypassing point set S, and at the moment, planning ends. According to the invention, bypassing of the circular barriers is realized through a simple geometric principle, and the UVV can rapidly and efficiently obtain a safe bump-free two-dimensional route in a complex environment with multiple circular barriers.

The invention discloses a satellite cluster configuration adjustment planning method for space target collaborative observation. According to the method, each satellite is regarded as an intelligent Agent with autonomous planning and decision-making capability, a coordination graph based on a cluster communication structure is established, and tasks optimized by a global optimal configuration adjustment strategy are decomposed to local learning of each satellite based on the communication coordination graph. According to the method, the top-layer planning of configuration adjustment and bottom-layer control are comprehensively considered; solving is carried out from the perspective of cluster cooperation planning; the global planning learning task is divided into the paired Agents according to the communication relationship, so that the autonomy and intelligence of the satellite cluster are enhanced, the on-orbit viability and the task execution level of the satellite cluster are improved, and a new idea and method are provided for on-orbit autonomous operation and management of the satellite cluster.

The present invention provides an intelligent tower connected graph construction method for planning the inspection route of an unmanned aerial vehicle (UAV). The method comprises the steps of A, predicting the distribution of transmission line towers according to the single-element nonlinear regression prediction method to generate a plurality of tower lines, wherein each tower line is composed of a plurality of towers; B, based on the critical conditions of tower distribution, connecting the plurality of tower lines to form a line connection graph, wherein the critical conditions are composed of crossed crossing condition, parallel distribution situation of multiple tower lines at a relatively near distance relative to one another, tower steering condition and tower branch condition; C, constructing a storage structure of the line connection graph. According to the technical scheme of the invention, power transmission lines are intelligently planned based on the above algorithm, so that the planning efficiency is improved. Meanwhile, an entire patrol scheme is provided. In this way, not only the patrol can be conducted on going and returning paths, but also the line inspection is conducted on going and returning paths. Therefore, the line inspection efficiency is greatly improved. Based on the intelligent traversal algorithm, an optimal inspection route for a line network can be planned. In this way, all towers can be traversed within a region at a shortest inspection distance.

The invention discloses an unmanned vehicle motion planning method oriented to planning control joint optimization. The method comprises the steps: obtaining a global linearized model through the recognition of an original kinetic model of a vehicle, and obtaining a simplified model through the order reduction of the global linearized model. During planning, a simplified kinetic model is considered and the non-convex obstacle constraint is also convex to consider the existing obstacle constraint, and the planning module plans the trajectory, the speed and the like by combining the simplified model and a rolling time domain ADP method, so that the planning efficiency is improved, the consistency of planning and control is ensured, and the motion result of the vehicle effectively meets the anticipated requirements.