3688 results about "Planning method" patented technology

Methods, systems and computer readable code for travel planning are provided. According to some embodiments, a travel planning engine schedules a plurality of activities within one or more time intervals and generates a travel plan, where each activity is associated with a physical location and optional time parameters. Alternatively or additionally, the travel planning is implemented by receiving manual travel planning directives through a user interface. According to some embodiments, the activities are scheduled so as to satisfy specific constraints and/or travel benefit parameters. According to some embodiments, the travel plan includes information about traveling between relevant locations. Some embodiments of the present invention include a method of comparing and/or presenting a plurality of travel options, wherein each travel option is associated with a respective mode of transportation. Some embodiments of the present invention provide a system, method or computer readable code for customizing a travel itinerary for a traveler. Some embodiments of the present invention provide a system, method or computer readable code for presenting information about pricing of at least three targeted travel services on a single screen including a plurality of distinct bundling combinations.

Methods, devices and systems for digitizing a patient's arch and manipulating the digital dental arch model. In one variation the methods includes producing a physical arch model for the patient's arch, separating the physical arch model into a plurality of arch model components, mounting the arch model components on a scan plate, capturing one or more images of the arch model components, and developing digital representations of the arch model components using the captured one or more images.

The present invention provides a deep and reinforcement learning-based real-time online path planning method. According to the method, the high-level semantic information of an image is obtained through using a deep learning method, the path planning of the end-to-end real-time scenes of an environment can be completed through using a reinforcement learning method. In a training process, image information collected in the environment is brought into a scene analysis network as a current state, so that an analytical result can be obtained; the analytical result is inputted into a designed deep cyclic neural network; and the decision-making action of each step of an intelligent body in a specific scene can be obtained through training, so that an optimal complete path can be obtained. In an actual application process, image information collected by a camera is inputted into a trained deep and reinforcement learning network, so that the direction information of the walking of the intelligent body can be obtained. With the method of the invention, obtained image information can be utilized to the greatest extent under a premise that the robustness of the method is ensured and the method slightly depends on the environment, and real-time scene walking information path planning can be realized.

The invention discloses a parking system path planning method based on dynamic time windows, and belongs to the technical field of path planning. The method is characterized by comprising the following steps: S1, building a work environment model of AGVs in an intelligent garage in a topological method; S2, setting priority for each AGV and each car parking/picking task according to different evaluation criteria; S3, using a Dijkstra algorithm to plan a shortest possible path for an AGV accepting a task; S4, arranging feasible path time windows; S5, designing conflict resolution strategies according to different types of conflicts; and S6, planning a conflict-free optimal path for the AGV using a parking system path planning algorithm based on dynamic time windows. A time-sharing use strategy is used, and the Dijkstra algorithm and a time window method are combined effectively, so that the problem that the existing multi-AGV path planning is of poor flexibility and is prone to deadlock or collision conflict is solved effectively, and a shortest conflict-free optimal path can be planned for an AGV accepting a task. In addition, the overall operation efficiency of an intelligent three-dimensional parking system can be improved effectively, and the car parking/picking waiting time can be reduced for social members.

Methods for simulation of heat transport phenomena applicable to the design of a near-field microwave ablation device, the design of such a device based on simulation and a patient planning and monitoring station using simulated thermal ablation of tissue are provided.

The invention relates to a flight path planning method based on a sparse A* algorithm and a genetic algorithm and belongs to the technical field of flight path planning of an unmanned aerial vehicle (UAV). According to the characteristics of flight path planning, the method comprises the following steps: planning an initial reference flight path by the utilization of the sparse A*search (SAS) algorithm, wherein constraint conditions are combined into algorithm search, so that useless nodes in a search space can be effectively deleted and the search time is shortened; and when emergent threat occurs during real-time flight of the UAV, performing real-time flight path planning by the utilization of the genetic algorithm and generating a flight path with local optimum or approximate optimum until the threat disappears and the UAV returns the original global optimum reference flight path and continues flying. The method provided by the invention has high real-time performance and rapidity; the searched flight path is closer to the actual UAV optimal flight path; and the method can be applied to the technical fields of robot path planning, urban vehicle path planning and the like under complex environments.

The invention discloses a double-layer planning method based on the combination of global path planning and local rolling prediction collision avoidance planning, so as to solve the problem of path planning for a mobile robot in a dynamic environment. The method mainly comprises two parts: the global path planning and the local rolling prediction collision avoidance planning. The path planning method can better realize robot navigation, and improve intelligence of the robot. The double planning method can be utilized to prevent the blindness of planning in the beginning, and searching space of the problem is reduced; based on the uncertainty of the moving direction of a dynamic barrier and by utilizing the two collision prediction strategies and two corresponding collision avoidance strategies, the dynamic barrier can be avoided well; and particularly, in order to adapt to the change of environment better, in the second layer of planning, a Follow_wall behavior based on behavior method is added, so that when the environment changes, the mobile robot can still arrive at the target without touching the barriers safely.

Disclosed is a treatment planning method that can be used to maximize the effectiveness of minimally invasive treatment on a patient. Pursuant to the treatment planning method, the presence of lung disease, such as emphysema, is first identified, followed by a determination of the distribution and extent of damage of the disease, followed by a determination of whether the patient is suitable for treatment, and a determination of the appropriate strategy for treatment for a suitable patient.

Methods and apparatuses of planning a wireless local area network are disclosed. Various embodiments receive data such as floor plan data, coverage data, and/or capacity data about a site for the WLAN. Based on such data, features of the WLAN access points can be determined. Examples are the quantity, placement, and/or configuration of the access points.

The invention relates to a method for planning a path for a mobile robot based on environmental modeling and a self-adapting window, which relates to a method for planning a real-time path for the mobile robot. The method comprises the following steps of: performing modeling and analysis on a multiple constraint local environment; performing passable analysis; performing safety analysis; performing motion smoothness analysis; performing goal-directed analysis; and performing path planning by adopting the self-adapting window. Because the method has better environmental suitability and obstacle avoiding capacity, the method obtains good safety and reachability, has high calculation real-time property, so the method solves the problem that the mobile robot generates an obstacle avoidance path in real time in an uncertain complex environment, provides a path selection method with optimized integration, better meets the requirements on obstacle avoidance for the mobile robot, realizes the real-time path planning and control of the robot, and provides an effective collision-less path planning method for the navigation application of the mobile robot.

Improved devices, systems, and methods for diagnosing, planning treatments of, and/or treating the refractive structures of an eye of a patient incorporate results of prior refractive corrections into a planned refractive treatment of a particular patient by driving an effective treatment vector function based on data from the prior eye treatments. The exemplary effective treatment vector employs an influence matrix which may allow improved refractive corrections to be generated so as to increase the overall accuracy of laser eye surgery (including LASIK, PRK, and the like), customized intraocular lenses (IOLs), refractive femtosecond treatments, and the like.

The invention relates to a dispatching and route-planning method for multiple AGVs used for material transportation in a factory. The method comprises the following steps: (1) modeling material transportation scenes in a factory, including the travelling routes of AGVs, AGV charging points, loading and unloading points and standby zones for AGVs; (2) storing allocated tasks in a queue; (3) findingout one AGV closest to a current-task issuing site from a set of available AGVs; (4) calculating the shortest route from a current-task start point and a current-task stop point by using an A* algorithm; and (5) calling a time-window algorithm for maintenance of a time-window vector table of the shortest route obtained in the step (4). Compared with traditional A* algorithms, a heuristic functionin the A* algorithm used in the invention takes the traveling cost and turning cost of the AGVs on roads in a workshop into consideration, the time-window vector table of each route section is maintained, and whether conflicts exist in planned routes is determined by judging whether superposition exists; so the problems of collision conflicts, deadlock and the like of AGV route planning are effectively overcome.

The present disclosure is directed toward global medical data analysis methods, systems, and computer program products for analyzing, classifying, and matching mass amounts of medical information from many sources and across different regions. The global medical data analysis system includes a medical main server that contains an intelligent medical engine, which is communicatively coupled to a central database, a confidential electronic medical records database, and further communicatively coupled through a network to hospitals, clinics, and other medical sources. The intelligent medical engine receives voluminous medical record, potentially from different countries, regions, and continents. Electronic Medical records are sourced from hospitals, clinics, and other medical sources, which are fed into the intelligent medical engine for large-scale analysis and correlation of patients' medical records globally. The analysis starts by degrouping (classifying) medical records into multiple levels of subgroups according to patient clinical parameters, disease templates, treatments and outcomes. When a new patient enters the system, that patient's parameters and disease template are matched against the closest subgroups to suggest treatments with potentially favorable outcomes.

An environment recognizing device and an environment recognizing method can draw an environment map for judging if it is possible to move a region where one or more than one steps are found above or below a floor, a route planning device and a route planning method that can appropriately plan a moving route, using such an environment map and a robot equipped with such an environment recognizing device and a route planning device. The robot comprises an environment recognizing section including a plurality of plane extracting section 401 adapted to compute plane parameters from a parallax image or a distance image and extract a plurality of planes including the floor surface, an obstacle recognizing section 402 adapted to recognize obstacles on the plurality of planes including the floor surface and an environment map updating section 403 adapted to draw an environment map (obstacle map) for each of the planes on the basis of the result of recognition of the obstacle recognizing section 402 and update the existing environment maps and a route planning section 404 adapted to plan a route on the basis of the environment maps. The route planning section 404 selects a plane as route coordinate when an obstacle is found on it in the environment map of the floor surface but not found in the environment map of the plane.

The invention relates to a power distribution network double layer planning method considering the time sequence and the reliability. The method comprises: according to the meteorological files and the load power statistical data, obtaining the typical daily power time sequence curves of the wind electricity, the photovoltaic output and the load in different seasons; based on the opportunistic constraint planning method, creating a power distribution network framework and a distributed power capacity double layer planning mathematical model, including the objective function and the constraint condition; using the particle swarm optimization algorithm to solve the model and using the minimum spanning tree algorithm to ensure the radiation and connectivity structure of the distribution network during the iterative process; and obtaining the target network framework and the Pareto optimal solution set of the distributed power capacity so as to generate the best planning scheme. The invention solves the problems that unnecessary investment into the a power distribution network incurred by the fact that a traditional power distribution network planning method containing a distributed power supply cannot reflect the typical output characteristic of a distribution type new energy; and 2) that by incorporating the power distribution network power supply reliability into a model target function, the reliability target can be realized at the planning stage.

Methods and apparatus for orthodontic treatment planning that involve determining an initial position of an orthodontic structure, determining an altered position, and generating response surface data using a mathematical relationship between the positions. The mathematical relationship may be defined by a number of parameters useful for determining one or more of the stress, strain, force, and moment associated with movement of the orthodontic structure. The mathematical relationship between the initial position and the altered position may be defined using a finite element analysis, empirically determined, or using other computational methodologies such as a finite difference methodology. The mathematical relationship may also be defined using an analytical methodology, such as elasticity and/or plasticity methodologies. Response surface data may be generated as a teaching aid, treatment planning aid, table, or other useful form, which may be useful, for example, for designing an orthodontic appliance, verifying an orthodontic prescription, and/or planning the prescription.

Methods, apparatuses, and computer program products are described herein that are configured to be embodied as and/or performed by a document planner. In some examples, a method is provided for generating a document plan. The method may include receiving a document plan template and a message store. The document plan template may include program code defining the structure and content of a document plan. The method may also include processing, by a processor, the document plan template to determine one or more messages from the message store for inclusion in the document plan. The method may also include generating the document plan. A structure and a content of the document plan may be determined at least based on the determined one or more messages and the document plan template. Apparatuses and computer readable media are also provided.

A path planning device includes: an initial position and posture path acquiring unit which acquires an initial position and posture path including a plurality of nodes connecting present position and posture of a control target to target position and posture and which configures a rigid body corresponding to the control target in each node in the position and posture path; an interference detector which detects interference with the control target by an obstruction; an external force calculator which calculates an external force for each rigid body; and a multi rigid body system dynamics simulation unit which performs a multi rigid body system dynamics simulation on a plurality of equations of rigid body motion and which acquires positions and postures of the control target at times corresponding to the nodes in the position and posture path.

The process of programming local path of mobile robot based on binary environmental information includes the following steps: 1. calculating the coordinates of the target point in the local path programming coordinate system; 2. calculating the default path without barrier; 3. initializing the intermediate variables; 4. obtaining binary environmental information description based on the output of the sensor and classifying the barriers; 5. selecting current optimal arc section; 6. calculating the relative position relation between carriers and the current optimal arc section, and re-classifying the barriers; 7. renewing the right and left barrier bypassing arc sections, and backing to the step 4 for the next loop; and 8. outputting the local path programming results. The present invention is simple and high in efficiency, and can meet the real-time programming requirement for continuous walking of mobile robot.

The invention discloses a concave convex mixed complex polygon farmland unmanned aerial vehicle spraying operation flight path planning method. Starting from any feature point on the boundary of the polygon farmland, all feature points of the boundary of the polygon farmland are acquired sequentially, adjacent two points are connected by using a straight line sequentially according to the point acquisition sequence of the feature points, and an operation region of the boundary of the polygon farmland is generated; the longest edge of the boundary of the operation region is found out; a feature point farthest from the longest edge is found out; N flight path lines are drawn between the longest edge and the feature point farthest from the longest edge; coordinates of all boundary line segments crossed with the flight path lines and flight path line crossed points are obtained; the number of the crossed points between the flight path lines and the boundary line segments is judged, and when the number of the crossed points is larger than 2, flight path lines outside the operation region range are deleted; and starting from a flight path line nearest to the longest edge, the flight path lines and side flight lines are connected in sequence, and an S-shaped flight path planning line is obtained. The flight path of the concave convex mixed complex polygon farmland unmanned aerial vehicle spraying operation can be planned.

The present invention provides an S-shaped acceleration and deceleration control method for changing speed and position of an object on line. The method comprises the acceleration phase speed planning, the deceleration phase speed planning, the constant speed phase speed planning, the real speed reduction point predication, the maximum speed processing, the surplus distance compensation, the online object speed changing algorithm and the online object position changing algorithm. An acceleration and deceleration discretization speed planning method is employed and the user input parameters are combined to calculate the operation time of a seven-phase speed planning phase. It is determined whether the maximum acceleration and the maximum speed can reach the criterion or not, the integration problem of a sampling period Ts according to the acceleration/deceleration acceleration, the acceleration/deceleration speed and the final position L after discretization is considered, and the real reachable acceleration/deceleration acceleration, the acceleration/deceleration speed and the feed rate are corrected. The S-shaped acceleration and deceleration control method for changing speed and position of the object on line greatly simplifies an original calculation formula and saves lots of operation time of a computer, and the surplus distance employs a one-time compensation method in the speed reduction process.

The invention discloses a transitional tracking planning method applied by an industrial robot, which can realize the transition between a joint space track and a cartesian space track, and the transition between two tracks of the cartesian space, the transitional track between different movement tracks are planned under the cartesian space, and has an intuitive shape; by adopting the algorithm that two parabolas are fused into one transitional curve, the smoothness of the track, speed and acceleration can be ensured, and the curve shape is controllable; the transitional track is formed by six independent curves, and the transition can be realized on the track with only posture change without position change; from the engineering application angle, the path velocity of transitional track boundary is restrained by utilizing the included angle between the tracks and the system allowable chord error, the boundary posture rotation speed is restrained by the similar mode, so that the large impact on a mechanical system caused by overhigh engagement speed can be prevented.

A method and computer program product for providing survivor income-replacement benefits having a guaranteed rate of interest with the possibility of a higher income stream to the designated survivor if supported by prevailing interest rates at the time of annuitization. In one embodiment, the insured would purchase either a fixed level dollar amount of monthly income for a fixed period of time or a Cost of Living Adjusted (COLA) benefit in the form of a monthly annuity. The insurance carrier is required to contractually guarantee a minimum rate of interest, e.g., 3% at the time of annuitization. The insurance carrier is further required to apply the same discount rate to the annuity contract that is provided to the best commercially available immediate annuity contract the carrier offers at the time of annuitization, subject to the minimum guaranteed rate of interest. Thus, the beneficiary may receive an increased income stream if the relevant interest rate at the time of the purchaser's death exceeds the guaranteed minimum interest rate. Thus, if the insured purchased a survivor benefit under the inventive method with a 3% guaranteed minimum COLA, and if the best commercially available immediate annuity interest rate is 6%, the benefit paid the beneficiary survivor is increased annually at a rate of 6%. Without COLA, the contract simply starts paying higher level monthly benefits based on the higher 6% discount rate.