50results about How to "Solve planning problems" patented technology

The invention discloses a micro-grid planning and capacity allocation method based on multi-objective optimization. The method is characterized in that the method comprises the steps of (1) setting the operation mode of a micro-grid, wherein the operation mode of the micro-grid comprises an independent mode and a grid-connected mode; (2) inputting basic data which comprise the system condition, electrovalence parameters, load parameters, photovoltaic parameters, wind electricity parameters and storage battery parameters; (3) pre-processing the basic data; (4) optimizing a distributed power supply and an energy storage system. According to the micro-grid planning and capacity allocation method, distributed power supply capacity and energy storage system capacity in micro-grid planning can be solved jointly, and optimizing allocation can be carried out at the same time.

The invention provides a multi-missile collaborative route calculation method based on a multi-target evolution method, which belongs to the technical field of task planning. The method specifically comprises the steps of: coding missile routes, defining missile mobility characteristics, modeling a planning area, generating route initial populations, evolving the route initial populations to generate new-generation route populations, evaluating the new-generation route populations to generate a rout set Q, evolving the route set Q among the populations to obtain a new-generation route set Q', evaluating the obtained new-generation route set Q', judging whether collaborative conditions are satisfied or not and the like. The method provided by the invention abandons the traditional route planning mode aiming at a single missile and can conduct collaborative planning to multiple missiles. By giving full consideration to the spatial conflict relationship and the attack arrival time relationship among the multiple missiles during planning, the realization of simultaneous set-time attacks to multiple enemy targets, saturation attacks to a certain enemy target and the like is facilitated and the attack efficiency is improved.

The invention discloses a vehicle path scheduling method and a vehicle path scheduling device. The vehicle path scheduling method comprises the following steps: acquiring a starting point and a destination of a vehicle, and positioning the starting point in a map, wherein the map comprises a road attribute; acquiring vehicle information of the vehicle; scheduling the global path from the startingpoint to the destination according to the vehicle information and the road attribute. According to the vehicle path scheduling method and the vehicle path scheduling device, the vehicle path scheduling enforceability is improved by the generated optimal global path when an intelligent vehicle travels.

The present invention discloses a distributed power supply access power distribution network planning method. The method comprises: establishing the power distribution network extension planning model of a distributed power supply, wherein the power distribution network extension planning model is a mathematic model for the line operation cost, the distributed power supply construction cost and the purchasing electricity cost reduced through the reduction of the access of the distributed power supply, employing a genetic algorithm for solution, employing the adaptive genetic algorithm for planning of the distributed power supply, employing the genetic algorithm for extension planning of the network aiming at the individual of distributed power supply capacity and position generated by each generation in the genetic algorithm, adding the influence of the distributed power supply, and repairing non-feasible solution generated by the intersection and mutation operation in the genetic algorithm, and performing economic evaluation of the integrated planning result of the distributed power supply and the network. According to the actual condition of the distribution network structure and the capacity and the distribution position of the distributed power supply, and the problems of the planning of the distribution network, the site selection and the constant volume of the transformer station and the site selection of the distributed power supply are solved through adoption of the appropriate algorithm.

The invention provides a robot path planning method for target searching. The problem that a robot in the current market is low in efficiency of carrying out a target searching function is solved. A robot target search path planning algorithm is put forward by firstly fusing an environment key point locking algorithm, a visual full coverage algorithm and a path planning algorithm based on discreteBayesian posteriori optimization. According to the path planning method, the robot can be driven to preferentially search the place where the target is most likely to appear. On the basis of a visualfull-coverage algorithm and a discrete Bayesian posterior optimization theory, a heuristic exploration mechanism fused into multiple algorithms is formed, the time for successfully completing a search task is taken as an optimization target, a probability cost calculation method combined with a Bayesian formula is introduced, and a simulated annealing algorithm is utilized, so that the learning efficiency of the model is improved. The method has the advantages that the model learning efficiency is high, the method is suitable for a known environment scene, and the robot can efficiently and rapidly find the target in a complex environment so as to plan the optimal path reaching the place where the target is most likely to appear.

The invention relates to a collision-free path planning method and device for a welding robot in a complex environment, computer equipment and a computer readable storage medium. The method comprises the steps of: performing initialization, and performing modeling; expanding nodes on the first node tree and the second node tree respectively, wherein the first node tree takes a starting point of the welding path as a root node, the second node tree takes a termination point of the welding path as a root node, and an extension mode is selected according to the complexity of a path search environment during node extension; judging whether a collision-free path from the starting point to the ending point can be obtained or not according to the nodes on the first node tree and the second node tree; taking the collision-free path as an initial path, and performing interpolation processing on the initial path; performing post-processing optimization on the interpolated path to obtain a collision-free shortest path; and returning to the shortest path. The path planning method provided by the invention is high in universality, has relatively high efficiency and robustness, and can adapt to different complex path planning environments.

The invention discloses a maneuvering communication network intelligent planning method and device based on deep reinforcement learning, and the method comprises the following steps: 1, preprocessingresource elements: preprocessing the resource elements of a guarantee node, a guaranteed user, an erection region and the like of a maneuvering communication network; 2, preprocessing planning rules,namely preprocessing the planning rules of the mobile communication network; 3, generating a training sample: performing random Monte Carlo search calculation on the preprocessing result to generate the training sample; 4, performing model training: based on the recurrent neural network, training a network planning model by using the training sample; and 5, performing model generation: constructing a joint loss function, repeatedly searching and training the sample according to the indication of the joint loss function, and generating a maneuvering communication network planning model. The deep reinforcement learning-based maneuvering communication network intelligent planning method and device effectively solve the problems that the current maneuvering communication network planning depends on a large amount of manual operation, the planning time exceeds the task requirement, the adaptability to sudden tasks and strange environments is poor, the resource utilization rate is low and the like, and improves the overall efficiency of maneuvering communication network planning.

The invention discloses an LNG-oriented distribution management system. The system comprises a map presentation module, a layer management module, a monitoring and early warning module, a statistical analysis module, a distribution management module and a user management module. The invention solves the linkage problem between upstream and downstream LNG supply and demand units, and realizes the automatic acquisition of LNG demand and the unified distribution scheduling.

The present invention discloses a shared bicycle parking management system, which comprises the following steps of connecting the mobile device of a shared bicycle with a server to search for a nearest available parking space; continuously sending messages to the management system through an intelligent parking pillar, identifying available parking spaces in a parking area and reserving a parkingspace; guiding the shared bicycle to a designated position through a GPS system; when the intelligent parking pillar identifies the mobile device of the shared bicycle, switching to local communications and/or P2P peer-to-peer computing; through the local communications, guiding the user of the shared bicycle to a correct position through the arrow of the intelligent parking pillar, inquiring themobile device to send out "Ping" (Internet Packet Explorer) to measure the distance; guiding the newly arrived shared bicycle to a final parked position; confirming that the parking coordinates of theshared bicycle are in the parking area, and sending a message that the bicycle has been parked in the correct position to a server management platform by the intelligent parking pillar; notifying themobile device of the shared bicycle by the server, displaying the condition of "parking completed", releasing the user and locking the bicycle.

The invention relates to the technical field of utility tunnels, and in particular relates to a utilization system for leaking water of a utility tunnel. The system comprises the utility tunnel and a regulating and storing pool, wherein the utility tunnel comprises at least a water supplying space; a water collecting tank is arranged in the bottom part of the water supplying space and is connected with the regulating and storing pool through a draining pipe; a liquid level sensor and a first water pump are arranged in the water supplying space; the liquid level sensor is connected with the water collecting tank; the first water pump is connected with the draining pipe. According to the utilization system for the leaking water of the utility tunnel, the problem that leaking water in the water supplying space of the utility tunnel is hardly drained and influences the overall waterproofing performance of the tunnel is solved, and the workload of maintenance workers is decreased; meanwhile, the problem of independent planning and constructing of a urban utility tunnel and rainwater regulating and storing construction of a sponge city can be solved; the utility tunnel and a rainwater utilizing facility of road construction are combined and integrally planned, designed and constructed, so that the cost is decreased, and the influence of the construction to an urban road is minimized.

The invention provides a satellite rolling attitude planning method considering thermal control and measurement and control constraints based on sight pointing. The satellite rolling attitude planningmethod comprises the steps of (1) injecting task satellite position information and target satellite pose measurement information into a ground measurement and control station; (2) resolving a sunlight unit vector under an orbital coordinate system of the task satellite; (3) resolving a position vector of the measurement and control station under a J2000 geocentric inertial system; (4) determining thermal control and measurement and control constraints; (5) determining a fly-around rotating shaft and a maximum fly-around angle; (6) obtaining a fly-around angle value set; (7) obtaining a rolling angle feasible region meeting the thermal control constraint, a rolling angle feasible region meeting the measurement and control constraint and a rolling angle feasible region simultaneously meeting the thermal control and measurement and control constraints for the fly-around angle; (8) obtaining a rolling angle feasible region meeting the thermal control constraint, a rolling angle feasibleregion meeting the measurement and control constraint and a rolling angle feasible region simultaneously meeting the thermal control and measurement and control constraints in the whole fly-around process; and (9) generating a rolling angle expected value sequence of the task satellite, and injecting the rolling angle expected value sequence into the satellite.

The application discloses a multi-user reservation scheduling route planning method which comprises the following steps: constructing a time window variable according to a time limit that an access toa destination is allowed in route planning; constructing a matching degree variable according to a matching degree of each actor in the route planning and the destination; adding the time window variable and the matching degree variable into an ant colony algorithm, so as to obtain a multi-user reservation scheduling ant colony algorithm; planning a route by adopting the multi-user reservation scheduling ant colony algorithm. A variant of the ant colony algorithm is obtained by adding the time window variable and the matching degree variable into the original ant colony algorithm according tothe multi-user reservation scheduling route planning, a scheduled route of each actor can be obtained under the condition of multi-user reservation scheduling by adding parameter data in calculation,and the problem of multi-user reservation scheduling route planning is solved. The application also discloses a multi-user reservation scheduling route planning device, a computer and a computer readable storage medium which have the beneficial effects.

The invention relates to a comprehensive energy system topology optimization method considering an energy flow delay characteristic. The optimization method comprises the following steps of S1, establishing a comprehensive energy system network mechanism model including a steam and hot water conveying network, a chilled water and cold air conveying network and a compressed air conveying network; s2, calculating response characteristics of key parameters such as temperature and flow of a working medium at the tail end of each energy flow transport network along with fluctuation of a source end;s3, establishing an objective function of the lowest comprehensive delay of various energy flows, the weight coefficient of each energy flow delay being obtained by a fuzzy analytic hierarchy process; s4, constructing a supply and demand working condition combination set, and setting a plurality of energy flow supply and demand matching constraints and comprehensive energy system network node space distribution constraints; and S5, solving an optimization problem formed by the target function and the constraint condition in the above steps by adopting a particle swarm optimization algorithm to obtain an optimal topology planning scheme of the comprehensive energy system.

The invention discloses a three-section type control strategy for achieving long-distance fixed-point suspension of an airship. According to the invention, based on the initial distance, setting a speed reduction start distance and a suspension start distance; measuring a real-time flight position of the airship, comparing the real-time flight position with a target suspension position and making control mode selection judgment; setting the expected speed of the constant-velocity flight of the airship to be ud, setting the actual forward flight speed of the airship to be u, marking speed errors to be eu, and carrying out forward tracking control rule designing of the airship in the constant-velocity slight segment; selecting expected speed of the suspension start section and carrying out speed reduction section control; measuring the position information and the forward speed information of the airship and carrying out small-distance precise fixed-point suspension control; and establishing an airship pitching channel model and calling and controlling control parameters through simulation. The beneficial effects are that dynamic and steady-state performance of fixed-point suspension at the end section in case of the long distance is improved.

The invention provides a method for planning a flight route of a short-distance transportation unmanned aerial vehicle, and the method comprises the following steps: 1, reading a model, to be more specific, reading a map with building height data from a map database; 2, determining a height, to be more specific, calculating the average value of the building height data; 3, intercepting a constant-height surface, to be more specific, intercepting a corresponding plane graph from map data by use of the calculated average value as an interception height; 4, bending a connection line, to be more specific, taking a point on one part, passing through a building cover surface, of the connection line between a starting point and a terminal point as a bending point to bend the connection line and enable the connection line not to pass through any building cover surface; 5, optimizing a path, to be more specific, the height of the obtained connection line is increased by 3 to 10%, two ends of the connection line are connected with the connection line are connected with the starting point and the terminal point, and curve smoothing treatment is performed on the two ends of the connection line; and 6, sending the path. According to the method, the flight path planning problem of the short-distance transportation unmanned aerial vehicle can be effectively solved by a process with an extremely small amount of calculation in a very low cost manner.

The large-scale charging pile planning model modeling method based on the small data comprises: carrying out that charging rule modeling according to small-scale electric vehicle charging behavior characteristic data, and obtaining a data distribution model of each characteristic data; and predicting large-scale charging data by adopting a data distribution model obtained by a Monte Carlo method to obtain to obtain a charging behavior when the electric vehicle is accessed in a large scale; and based on the large-scale charging data predicted by the Monte Carlo method and the model hypothesis,deriving and obtaining an equivalent charging load curve; constructing a regional charging pile planning model for realizing minimum peak-valley difference between charging equipment investment and disordered charging loads; and carrying out optimization solution by combining related constraint conditions and considering other influence factors in a regional charging pile planning model establishment process. By the adoption of the modeling method, large-range charging pile setting can be planned on the basis of existing small-scale data, and the minimum peak-valley difference of equipment investment and disordered charging loads during electric vehicle charging is achieved.

The invention relates to the technical field of splicing point multi-branch path planning, in particular to a splicing point multi-branch path planning method of a virtual bronchoscope, which comprises the following step of segmenting a bronchus tree from an acquired lung CT sequence image by using a three-dimensional region growth algorithm. According to the splicing point multi-branch path planning method and system for the virtual bronchoscope, the planning effect of complex multi-branch paths and large-curvature turning branch paths can be achieved through a splicing point path planning algorithm, and a high-quality center line image meeting the requirements for centrality, connectivity and singleness of a center path can be obtained; the methhod is an important premise for planning the bronchial tree path by using a splicing point algorithm, can solve the problem of multi-branch path planning of automatic roaming of the virtual bronchoscope, adopts the splicing point branch path planning algorithm, and can quickly and conveniently plan an automatic roaming path reaching any branch end point after obtaining the complete center line of the bronchial tree.

The invention relates to a black start power supply location selection method suitable for an electric power system partition recovery mode, which has the technical features of forming a network topology matrix, and adopting a discrete particle swarm optimization algorithm to generate an initial scheme of black start power supply location selection; adopting a continuous particle swarm optimization algorithm to generate an initial scheme of unit partitioning and sorting; adopting the Dijkstra shortest path algorithm to calculate the unit capacity recovery speed of the initial scheme; according to the particle change rule of the continuous particle swarm optimization algorithm, generating a new scheme of unit partitioning and sorting; calculating the weighted sum of the power construction cost of the black start power supply location selection scheme and the unit capacity recovery speed as an evaluation value; and according to the particle change rule of the discrete particle swarm optimization algorithm, generating a new scheme of black start power supply location selection. The method solves the planning problem of selecting the location of the black start power supply, proactively prevents blackouts from the electric power system planning and design level, and improves the recovery efficiency of the electric power system after the blackouts.

The invention discloses a college student growth path evaluation system which is mainly formed by connecting a client, character interest evaluation, occupational value evaluation, occupational quality evaluation, basic intelligence evaluation, knowledge and skill evaluation, personal growth analysis and growth path recommendation. According to the college student growth path evaluation system, the college students are helped to plan the future and find the development direction of life by integrating personalized series evaluation in five aspects of personality interests, occupational value,occupational literacy, basic intelligence, knowledge skills and the like of the college students; the recommendation system adopts an advanced knowledge graph technology, so that the time in a personal growth path calculation process is reduced, and the situation that college students transit to employment socialization positioning from campus education is blindly unclear is avoided; and the college student growth path evaluation system plays a positive role in understanding the undergraduates and enhancing the cognition of social employment demands.

The invention belongs to the technical field of power grid planning, and particularly relates to a power grid side energy storage system capacity configuration method based on an improved simulated annealing algorithm. The method comprises the following steps: measuring an income y1 of delaying upgrading and reconstruction of a power transmission network by an energy storage system; measuring an increase wind power consumption income y2; measuring an environment cost y3 reduced by peak regulation of the energy storage system; measuring the annual cost yin of the whole life cycle of the energystorage system; and determining an optimal result max f = y1 + y2 + y3-yin of site selection configuration of the power grid side energy storage system according to the following objective function. According to the power grid side energy storage system capacity configuration method based on an improved simulated annealing algorithm, the possibility of falling into local optimum is reduced and theconvergence rate is increased. The method is reasonable in design, combines the advantages of a longhorn beard algorithm and a simulated annealing algorithm, a problem of energy storage system planning in a power grid is solved, and the operation economy of the energy storage system is improved.