269 results about "Route planning" patented technology

Embodiments of the present application provide a route planning method and related device for improving the prediction accuracy of the ranking model and the arrival time estimation model simultaneously. The method comprises: obtaining feature information of N candidate routes, the multiple candidate routes having the same starting point, ending point and departure time; sequentially passing the feature information of the N candidate routes through an arrival time estimation model and a ranking model to obtain arrival time information of the N candidate routes and ranking information of the N candidate routes, wherein the arrival time estimation model and the ranking model are obtained by collaborative training of a first target model and a second target model, and the first training sample set and the second training sample set are obtained by extracting features from sample pairs constructed from historical routes and alternative routes of the historical routes; and determining a target route according to the ranking information of the N candidate routes and the arrival time information of the N candidate routes. The method provided by the present application can be applied to the fields of maps, cloud technology and big data.

This invention discloses a collaborative management method and system for the entire warehousing and logistics process, belonging to the field of warehousing and logistics information technology. Addressing the technical shortcomings of existing warehousing and logistics management, such as low inventory accuracy, poor scheduling efficiency, lagging information collaboration, and insufficient cost control, this invention integrates the entire process of inbound, storage, picking, outbound, transportation, and traceability, constructing a closed-loop management system of "data perception - algorithm decision-making - process collaboration - dynamic optimization." Through multi-dimensional data collection, optimized algorithm scheduling, cross-system data collaboration, and full-process traceability technology, this invention achieves precise inventory control, optimized logistics route planning, and efficient resource allocation, significantly improving warehousing and logistics operational efficiency, reducing overall costs, and enhancing management transparency. It is applicable to the digital management needs of warehousing and logistics in various industries, including manufacturing, retail, and e-commerce.

This application discloses an aerial photography flight path planning method, which includes: acquiring a planar polygonal region; generating a first photography point; selecting a second photography point from the first photography point and setting constraints; if no set of second photography points satisfying the conditions exists, decreasing the focal length in the preset camera parameters and / or increasing the preset drone flight altitude, and then re-executing the step of calculating the rectangular coverage area to select the second photography point; if a set of second photography points satisfying the conditions exists, recording the current camera parameters and drone flight altitude, then increasing the focal length and / or decreasing the flight altitude, and re-executing the step of calculating the rectangular coverage area to select the second photography point; using the set of second photography points that last satisfied the constraints as the final planning result; planning the flight path and generating an aerial photography flight path file. This application can be used to solve the technical problems of low coverage efficiency and poor image clarity in existing aerial photography methods.

This invention discloses a UAV (Universal Aircraft) trajectory planning method for intercepting anti-ship missiles based on the goalkeeper interception concept. It aims to provide a novel, low-cost, and effective interception approach and method for anti-ship missiles, adding a layer of UAV anti-missile interception system to ship defense and further ensuring ship safety. This method, based on the goalkeeper interception concept, employs a non-iterative geometric approach to plan the UAV's interception trajectory. The trajectory planning process is completed in two steps. First, assuming the anti-ship missile is non-maneuverable and has a constant speed, the early warning detection system is used to detect the missile's speed, direction, and position. It is assumed that the detection information only has positional errors, but the specific error value is unknown. The UAV's trajectory is planned according to a straight line + circular arc + straight line trajectory pattern. Second, after the UAV detects the error-free anti-ship missile's position information, a new UAV trajectory is planned using a circular arc + straight line + circular arc + straight line trajectory pattern. If this is not feasible, a new UAV trajectory is further planned using a circular arc + straight line trajectory pattern with longitudinal speed control. This method is a non-iterative geometric approach, easy to implement in engineering. Simulation results show that this method can effectively implement route planning for UAVs to intercept anti-ship missiles.

The application discloses a mine area ship route planning method and belongs to the field of ship route planning. The method comprises the following steps: establishing a physical field characteristic model of a ship; constructing a first risk field model containing a predicted position sequence and a fuse trigger rule for each proven mine; constructing a navigable grid map; performing global path search based on the physical field characteristic model and the first risk field model to minimize the comprehensive navigation cost, and generating an initial global route; detecting a newly appeared mine in real time during navigation, predicting a movement trajectory of the mine, and constructing a second risk field model containing a predicted position sequence and a fuse trigger rule of the mine; performing space-time correlation analysis on the initial global route and the second risk field model to mark a dangerous navigation section; and performing path re-planning to obtain a local avoidance path. The application realizes accurate evaluation and dynamic avoidance of navigation risks in a mine area, and improves the safety and task completion capability of a ship during navigation in a mine area.

A carbon-aware vehicle routing system is provided for improving computational efficiency during route planning. The system stores road network data in memory and employs a processing circuit to execute a routing application. A route search region is established between a vehicle's current location and destination. Assessment points within the route search region are evaluated to identify high-emission points when carbon-emission levels exceed a predefined threshold. One or more high-emission spatial zones are defined using proximity-based expansion or graph connectivity relationships among adjacent high-emission points. The system constructs a route-search graph topology corresponding to a subgraph of the route search region that excludes the high-emission spatial zones. By reducing the number of nodes and edges involved in route computation, the system decreases computational load and resource intensity. A candidate route is generated through route computation performed on the reduced graph topology.

The present application belongs to the technical field of unmanned aerial vehicle navigation, and relates to a bamboo forest unmanned aerial vehicle full-autonomous visual navigation method and system fusing human operation experience. The system integrates multiple source perception units to construct a three-dimensional scene and a risk map; the pilot's line of sight distribution and operation habit are collected through eye tracking and flight control data, human experience strategy priori is formed through time sequence feature extraction and imitation learning, and is adaptively optimized under a reinforcement learning framework in combination with multi-target rewards such as coverage, safety, energy efficiency and behavior consistency to obtain a transferable autonomous navigation strategy; obstacle avoidance flight is realized in a manner combining global task route planning and local rolling track control, and automatically switches to a local safety strategy when communication or positioning is abnormal. Compared with the prior art, the present application can stably complete bamboo forest autonomous inspection in a complex environment, and significantly improves operation safety, running efficiency and information acquisition quality.

This invention discloses an intelligent goods delivery route optimization method, relating to the field of intelligent logistics and delivery technology. The method comprises the following components: S1, metaverse space construction; S2, user role creation and access; S3, immersive collaborative route planning; and S4, route optimization algorithm and data-driven approach. By constructing a logistics and delivery metaverse space, this invention achieves real-time synchronization between the real world and the virtual space, including synchronized updates of order information, vehicle location, and traffic conditions. This helps logistics dispatchers perform more accurate route planning in the virtual environment. Delivery personnel can also view and provide feedback on route planning schemes through virtual roles before executing tasks, thereby achieving multi-party collaborative immersive route planning. This method can significantly improve the efficiency and accuracy of goods delivery, reducing delivery delays or errors caused by information asymmetry or poor communication.

This invention discloses an intelligent route planning method and apparatus. The method includes: upon receiving a route planning request from a user for a target vessel, acquiring navigation information corresponding to the route planning request, the navigation information including at least the target vessel's starting point and ending point; determining the target vessel's navigation area based on the navigation information; acquiring the area information of the navigation area; and determining a set of optional routes matching the target vessel based on the navigation information and the area information, the set of optional routes including at least one optional route. Therefore, implementing this invention enables the determination of optional routes matching the vessel based on its navigation information and the area information of the vessel's navigation area, achieving intelligent route planning, improving the matching degree between the determined route and the vessel's navigation information, thereby improving the accuracy of route planning and ultimately enhancing the safety and reliability of vessel navigation.

The application is suitable for the field of data processing, and provides a passing path planning method and system, an electronic device and a computer program product, wherein the method comprises: acquiring a space reference space-time network; the space reference space-time network comprises a plurality of space-time edges, each space-time edge connects two waypoints and corresponds to a space-time range between the waypoints; determining at least one target space-time range corresponding to a space emergency event and passing restriction information corresponding to each target space-time range; adjusting a target space-time edge corresponding to the target space-time range in the space reference space-time network based on the target space-time range and the passing restriction information, to obtain a space passable space-time network; and planning a target passing path for each target flight task in the space passable space-time network. The scheme performs fine management on the space, replans the path for the target flight task, and improves the utilization rate of the space resource.

A computer-implemented procedure comprises: (i) determining a user's current location using location data, (ii) determining, using location data, a user device's starting point based on the current location and a user device's destination based on user input, (iii) identifying, via a pedestrian route planner of a route planning application communicating with a navigation system, a pedestrian route between the starting point and the destination, (iv) identifying, via the navigation system, waypoints between the starting point and the destination, (v) transmitting the pedestrian route to the user device, (vi) outputting, via the route planning application, i) a haptic feedback protocol and / or ii) an acoustic feedback protocol associated with the waypoints.are, (vii) receiving pedestrian route data from the user device, and (viii) processing the pedestrian route data to determine user behavior.

The application provides a method, device and medium for unmanned aerial vehicle flight route planning based on space grid value, the method comprising: obtaining a starting grid coordinate of a starting grid and a destination grid coordinate of a destination grid of a target unmanned aerial vehicle; determining a plurality of initial flight routes from the starting grid to the destination grid according to the starting grid coordinate and the destination grid coordinate; determining a value of each target grid on each initial flight route according to the starting grid coordinate, the destination grid coordinate and each grid coordinate corresponding to each initial flight route; determining a total value corresponding to each initial flight route according to the value of each target grid on each initial flight route; and determining a target flight route from the plurality of initial flight routes according to the total value corresponding to each initial flight route, so that the value of the target flight route determined finally is the lowest, and the safety is improved.

This invention relates to the field of multimodal transport route planning technology and discloses a route planning method for multimodal freight transport. The method includes constructing an initial decision tree based on dynamic historical trajectories, where branches are sequenced path nodes, nodes are tool call chains, and leaf nodes are resource consumption profiles. By matching real-time constraints and cost objectives, iterative pruning and branch injection operations are performed on the decision tree to generate an optimized decision tree. After obtaining a set of candidate solutions through deduction, multi-dimensional robustness stress tests are conducted on them to simulate path stability and resource fluctuations under preset disturbances, selecting a subset of feasible solutions. Finally, the optimal solution is dynamically selected based on the real-time status and converted into an operation command. This method can adapt to changes in dynamic constraints and proactively ensure the robustness of solution execution.

This invention relates to the field of logistics distribution and route planning technology, and particularly to a method and system for periodic delivery route planning that balances driver workload and customer service order. The method includes: constructing a delivery plan for C customers over D days using a matrix-based chromosome encoding strategy; decoding chromosomes by inserting driver numbers into each row of the matrix, and constructing the daily delivery route for each driver based on the customer set and order obtained each day; performing population evolution based on a genetic algorithm framework, integrating driver workload balancing operators and customer service order balancing operators; calculating chromosome fitness in the population based on the periodic delivery route planning model, and using a tournament selection strategy to select chromosomes to form the next generation population. This invention better addresses the pain points of uneven driver workload and uneven customer service order in periodic delivery, and has certain practical reference value for optimizing the operation of periodic delivery systems.

This invention discloses an intelligent optimization method and system for cold chain delivery routes of hot pot ingredients in multiple temperature zones, belonging to the field of delivery optimization technology. The method includes: acquiring initial delivery order information, current vehicle location, vehicle energy status, and initial loading status of each refrigerated compartment; planning the initial driving route and adaptively generating a matching initial energy and temperature management plan for multiple temperature zones; when a new delivery order is received, selecting a target delivery vehicle from the fleet based on the route matching degree and the impact of the new order on the existing temperature management plans of each vehicle; updating the driving route and multi-temperature zone energy and temperature management plan of the target delivery vehicle, and executing the delivery. In summary, the advantages of this invention are: by deeply coordinating and dynamically optimizing delivery route planning and multi-temperature zone energy and temperature management, it improves the overall energy utilization efficiency of the delivery system while ensuring the storage quality and delivery timeliness of hot pot ingredients in multiple temperature zones.

Computer-implemented method for providing map data (K) with functional usability information (I), in particular for functionally optimized route planning, wherein the method comprises the following steps: - Acquisition of function usage data (D) in a vehicle (10) which has a driver assistance system (11), in particular by retrieving data from at least one control unit and / or sensor of the vehicle (10); - Transferring the function usage data (D) to a database (21); - Evaluating a large number of data records (D1, D2, ..., D10) from the database (21) to generate at least one, in particular numerical, functional usability information (I) for at least one road section (L); and - Providing map data (K) containing at least one road segment (L) and at least one function usability information (I), wherein the function usage data (D) contains at least the following: a time reference, a GPS position and status information describing a state and / or a change of state, in particular activation or deactivation, of the driver assistance system (11), wherein the evaluation of the plurality of data sets (D1, D2, ..., D10) comprises the following steps: - Determine a selection set of data records (D1, D2, ..., D10) that are associated with at least one road segment (L); - Classify the data records (D1, D2, ..., D10) in the selection set into at least one first class and one second class; - Calculating the proportion of data records (D1, D2, ..., D10) in the selection set that were classified as elements of the first class; - Generating at least one functional usability information (I) based on the calculated proportion, wherein the evaluation of the multitude of data records (D1, D2,..., D10) further comprises the following step for each data record (D1, D2,..., D10) from the multitude of data records (D1, D2,..., D10): - Calculating a weighting factor depending on the time specification of the data set, wherein the weighting factor is inversely proportional to the age of the data set; and wherein the generation of the functional usability information (I) is further based on the weighting factors, in particular using a regression analysis.

This application discloses a method for generating travel routes based on interest tag matching, belonging to the field of route generation technology. It addresses the problems of insufficient matching accuracy and decreased path continuity during travel route generation. The method generates interest weights by parsing user input semantics with tags and integrating search volume and historical behavior response frequency. It assesses popularity levels by combining the co-occurrence relationship of interest point tags, filters and labels POIs based on response weights and popularity levels, predicts user accessibility based on the opening time intervals of each POI, and generates an initial travel route. It collects the tag coverage quantity and travel distance of each POI along the route, analyzes behavioral conversion characteristics through tag coverage quantity, and calculates priority correction values ​​based on travel distance to optimize the initial route. Finally, it outputs a travel route that balances interest matching and itinerary continuity, improving the personalized adaptability and executability of route planning.

This invention discloses a multimodal intelligent guided tour route planning method and system, belonging to the field of intelligent path planning. The method includes: acquiring static GIS network topology data of the target geographical area; dynamically updating the environmental map data structure based on environmental parameters to generate a multidimensional dynamic weight matrix; receiving start-point and end-point requests, and calculating the comprehensive environmental cost of candidate nodes based on the multidimensional dynamic weight matrix using an improved multi-objective heuristic algorithm; optimizing candidate nodes according to the comprehensive environmental cost to generate an optimal guided tour route containing a node sequence and its corresponding travel timestamps; and generating a navigation instruction set based on the optimal guided tour route. This invention improves the overall traffic efficiency of scenic areas and the balance of visitor experience.

The application discloses a bus riding route planning method based on human-vehicle-road cooperation and belongs to the cross-application field of intelligent networked public transport system design. The method comprises the following steps: collecting passenger external origin-destination point demand data, real-time road condition data, bus station GIS data and road network GIS data; associating the external origin-destination point with the nearby bus station according to the passenger external origin-destination point demand data and the bus station GIS data; estimating the walking transfer time between the external origin-destination point and the corresponding bus station; sequentially connecting the bus stations associated with the external origin-destination point based on the shortest path principle to obtain the bus driving path; constructing an optimization model, with the target being the minimum total passenger travel time and the constraint condition being that the passengers only board from the bus stations associated with the external origin-destination point; and solving the optimization model to obtain the time and position information of the boarding and alighting bus stations.

The application discloses a method and system for material demand prediction and distribution path planning for a factory building machine, and relates to the technical field of demand prediction and path planning.The method comprises the following steps: obtaining design parameters of a target factory building; obtaining coordinates of the factory building machine in real time and calculating construction progress; running an adaptive speed prediction model to output future advance speed prediction; obtaining a future construction progress curve based on the predicted speed integral, combining with dynamic calculation of replenishment demand nodes to form a dynamic demand node set by mapping the predicted demand time and the factory building machine position; taking the dynamic demand node set as input, establishing a multi-objective vehicle path planning model, and solving an optimal distribution scheme; and finally issuing the scheme and periodically rolling and re-planning.The application realizes dynamic and accurate cooperation of material distribution and factory building machine construction, effectively improving the construction efficiency and industrialization level of the factory building machine.

The application provides a parallel rendezvous-based waiting state refueling route calculation method, and belongs to the technical field of route planning, which comprises the following steps: obtaining input refueling route key parameters, including a rendezvous starting point, a rendezvous control point, a refueling speed, a refueling height, a turning roll angle and the like; then, calculating refueling entry headings, turning radii and refueling offsets, turning starting points, turning ending points and the like key points according to the obtained input refueling route key parameters, so as to generate a complete waiting state refueling route. The application can calculate the refueling route according to the position of a receiver aircraft at any time, reduces the waiting time of the receiver aircraft, and improves the refueling efficiency.

The application discloses a kind of unmanned plane path planning method and related device based on triangle segmentation technology, method includes: based on the preset triangle route method obtains multiple unmanned plane inspection routes, forms unmanned plane inspection route set;With unmanned plane inspection route set as initialization particle group, route optimization calculation is carried out using preset genetic algorithm, obtain optimal unmanned plane route, preset genetic algorithm is based on the preset triangle segmentation algorithm optimization route selection, based on preset collision crossover strategy cross operation.Not only can select suitable genetic individual, but also can reduce calculation amount, while guaranteeing the reliability of route planning, also can minimize calculation pressure.Therefore, the application can solve the technical problems that the route planning method based on genetic algorithm in the prior art is limited by large calculation amount or large error, resulting in poor efficiency in engineering application process.

The application discloses a large-scale constellation hierarchical routing planning method for concurrent tasks, and belongs to the technical field of mega constellation management and routing planning.The application is used for solving the problem of constellation routing planning under large-scale concurrent tasks and large-scale nodes.The application comprises the following steps: dividing a large-scale constellation into constellation management domains, determining the shortest domain-level path from a starting constellation management domain to a terminal constellation management domain for each task, determining the initial entry domain endpoint and the initial exit domain endpoint of each constellation management domain based on a global routing reference direction, adjusting the exit domain endpoint of a congested node to obtain a final exit domain endpoint and a corresponding final entry domain endpoint, and dividing the tasks in the constellation management domain into rounds according to the estimated time sequence of the tasks to arrive at the constellation management domain, and selecting a low-load next-hop satellite node for each round of task.The application reduces the complexity of constellation routing planning under large-scale concurrent tasks and large-scale nodes, and realizes the optimization of network load balancing performance.

This invention provides a method, apparatus, device, and medium for UAV route planning based on Hilbert curves. The method includes: collecting real-time position, attitude, and environmental information of the UAV; constructing an initial UAV route using a Hilbert curve based on the UAV's mission requirements and the collected information; smoothing the initial UAV route and removing redundant paths using a Bézier curve to obtain an optimized UAV route; correcting the optimized UAV route based on real-time environmental changes to generate a safe route; and converting the safe route into executable control commands for the UAV to drive its operation, thereby solving the problems of insufficient space filling efficiency, poor adaptability to dynamic environments, and low path smoothness in dynamic path planning.

The application provides a tour route planning method and device, belonging to the technical field of path planning, the method comprises the following steps: step 1: constructing a GIS map of a recreation place, marking the entrance, intersection and play point as a point with a unique identifier; step 2: connecting each point to generate a directed path, the directed path includes a one-way path and a two-way path; step 3: calculating the shortest path between any two points by using the Floyd algorithm to generate a shortest route set RS; step 4: receiving the starting point, ending point and traversal point set input by the user, and generating a planned route through the optimal path point bridging and correction algorithm. The tour route planning method and device provided by the application can quickly generate a tour route covering all specified points, with the shortest path, the least repetition and dynamic requirements.

This application relates to a method for synchronizing information during group travel among car enthusiasts. The method includes: constructing a team data structure based on a team creation command and sending a team invitation; creating a shared information space for the team based on team identifiers and location authorization information and entering initial data; generating unified navigation and custom navigation route planning data, determining spatiotemporal convergence points, and storing them in association; processing and classifying member voice stream data, responding to voice playback requests and adapting playback attributes; detecting member route deviations and classifying deviation states, obtaining relevant status data, responding to travel description editing commands and updating information, integrating various data to generate a status synchronization message and pushing it to all member terminals. This method enables comprehensive synchronization of navigation, voice, status, and travel descriptions during group travel among car enthusiasts, ensuring team collaboration and improving travel experience and safety.

This invention discloses a route planning method based on communication link line-of-sight inspection, which includes the following steps: designing an initial route and collecting waypoints along the initial route; connecting ground stations with adjacent waypoints. 、 A line-of-sight plane is obtained by connecting the points sequentially. Several line-of-sight points are then identified within this plane. The communication link visibility check of each waypoint is evaluated by checking if its height is greater than or equal to the corresponding elevation data. This process is repeated for each waypoint until all waypoints pass the communication link visibility check, resulting in a route with good communication link visibility. This invention, through a surface matrix comparison method, reduces the error in the communication link visibility check, making it more reliable. Furthermore, it allows for the checking of the communication link visibility of all waypoints on the route, and the adjustment of the positions of waypoints with poor communication link visibility to obtain a route with good communication link visibility.

This invention provides a real-time route optimization method based on GPS vehicle positioning, belonging to the field of route planning and optimization technology. It acquires GPS positioning data, vehicle load data, hazardous material type data, and road restriction data of hazardous materials transport vehicles, and combines this with feasibility assessment and real-time risk assessment of candidate routes to achieve dynamic route optimization and priority ranking. When temporary traffic control is detected in sensitive areas, the route can be quickly replanned. This invention can significantly improve the safety and flexibility of hazardous materials transportation route planning, effectively reduce potential risks during transportation, and further enhance transportation safety while ensuring transportation efficiency.

This invention relates to the field of automotive performance testing and autonomous driving virtual simulation technology, specifically a method and system for generating continuous vehicle driving conditions based on GIS road networks and data-driven Markov chains. The method includes four main steps: S1, road topology map construction and OD route planning based on GIS big data; S2, random traffic breakpoint simulation based on a probability distribution model; S3, kinematic envelope construction based on bidirectional physical propagation; and S4, data-driven Markov velocity generation with forward aiming. By constructing a smooth envelope that absolutely conforms to the vehicle's kinematic limits through a unique bidirectional physical propagation algorithm, the abnormal problems of velocity steps and acceleration / deceleration exceeding physical limits in the random generation process of traditional Markov chains are completely solved. The generated driving conditions can be directly used for simulation testing without manual correction.

In precision agriculture, high-precision navigation, attitude determination, and obstacle detection methods are used to conserve resources and achieve better results. The collected machine position and attitude data, as well as obstacle location data, can be effectively utilized to synthesize control algorithms for autonomous agricultural machinery. These algorithms are applied to coverage path planning, route planning, motion stabilization along a specified path, obstacle avoidance, and ensuring guaranteed behavior.