355 results about "Planning process" patented technology

A client-server system for corporate travel planning, expense reporting and travel management that utilizes a corporate database server to enable accurate and timely pre-travel and post-travel decision making that is fed by a travel planning process and an expense reporting process, plus a SABRE data feed of all booked data and back office system data as well as a hand-off of exchange and void ticket information that comprises a Travel Planning module, a Travel Decision Maker module, and a Travel Expense Reporting module. The system uses a corporate database environment communicating with a real-time CRS data feed that enhances the Travel Planning module by offering the traveler live choices of air, car, and hotel availability based upon company travel policy as well as live access to current or company negotiated fares while also allowing the Travel Decision Maker module to make comparisons between booked information and actual current travel data.

Methods and systems are provided that may be utilized to make completion design an integral part of the well planning process by enabling the rapid evaluation of completion performance. This integration may include an earth model and may specify wellpath parameters, completion parameters, and other parameters in a simulation of operations using the earth model. The simulation generates well performance measures, which may be optimized depending on well performance technical limits. The optimization may be used to maximize an objective function. The system may include multiple users at the same or different locations (e.g. over a network) interacting through graphic user interfaces (GUI's).

This invention relates to a method for implementing an off shore/off site activity in an organization, with most optimal skills transfer process. The said process includes the steps of

• • assessing the suitability of outsourcing and whether the activity should be carried out on-site, locally or remotely, based on pre-determined parameters and decision ratios,
  • planning the process including the minimum groundwork required before the actual process can begin,
  • identifying the various milestones in the process and the deliverables in each milestones
  • monitoring the progress of the migration process and the ways and means to take corrective action, and,
  • evaluating the results of the development.

Disclosed is a computer-implemented planning process that aids a system administrator in the task of creating a job schedule. The process treats enterprise computing resources as a grid of resources, which provides greater flexibility in assigning resources to jobs. During the planning process, an administrator or other user, or software, builds a job-dependency tree. Jobs are then ranked according to priority, pickiness, and network centricity. Difficult and problematic jobs then are assigned resources and scheduled first, with less difficult jobs assigned resources and scheduled afterwards. The resources assigned to the most problematic jobs then are changed iteratively to determine if the plan improves. This iterative approach not only increases the efficiency of the original job schedule, but also allows the planning process to react and adapt to new, ad-hoc jobs, as well as unexpected interruptions in resource availability.

A system and associated method for automated disaster recovery (DR) planning. A DR planning process receives disaster recovery requirements and a target environment configuration from a user to design DR plans for the target environment configuration that meets disaster recovery requirements. The DR planning process accesses a knowledgebase containing information on replication technologies, best practice recipes, and past deployment instances. The DR planning process creates the DR plans by analyzing the disaster recovery requirements into element risks, associating replication technologies to protect each element risks, combining associated replication technologies based on the best practice recipes, and selecting highly evaluated combination based on the past deployment instances. The DR planning process presents the DR plans as classified by replication strategy-architecture combination for each DR plans and marks how strongly each DR plans are recommended.

The invention discloses an accompanying robot path planning method and system based on obstacle virtual expansion. The method includes a step of constructing an environment map, namely a step of constructing a two-dimensional occupancy grid map according to an actual scene, with each grid being labeled as an obstacle zone or a walkable zone; a step of setting initial coordinate positions of an accompanying robot and a movable target in the grid map; a step of constructing a sliding window for the robot; a step of subjecting the obstacle zones to expansion processing, namely a step of performing initial expansion on grids where an obstacle is according to a shortest distance between the center of the robot and a body edge, determining the number of grid layers expanded on the basis of the minimum impassable zone, adopting the grids in the expanded zones as obstacle virtual expansion grids, and labeling the grade of danger of obstacle influences on the obstacle virtual expansion grids; and a step of planning a path for the accompanying robot based on an A* algorithm and an incremental path planning process. Incremental path updating is performed by adopting a path of the last moment,thus saving path planning time and increasing the response speed of the accompanying robot.

Therefore, the illustrative embodiments provide an apparatus for performing horticultural tasks. In an illustrative embodiment, an apparatus is comprised of a number of data storage devices, a planning process, and a processor unit. The number of data storage devices includes a knowledge base. The processor unit executes the planning process and accesses the knowledge base on the number of data storage devices to identify a horticultural need for a plurality of plants.

A method for managing spare parts and tools for a manufacturing enterprise is disclosed. Historical demand values are statistically analyzed to determine optimal stocking levels for spare parts based upon required availability percentages, parts lead times, and the statistical distribution parts demand levels. Parts stocking decisions can also be based upon planned and preventative maintenance timeframes with such parts ordered on an as-needed basis in accordance with lead times. Spare parts inventory management can utilize an enterprise-wide computer system to integrate parts demand planning with systems used for engineering and other changes to manufacturing processes and facility maintenance systems. The computer system can perform varying degrees of the parts reordering and planning process and automate certain steps while providing for decision of other issues by parts management personnel.

The invention relates to a rapid forming method based on a double-forming head. The method comprises the following steps that (1) a three-dimensional solid model is built, and a model data file is output; (2) the model data file is recognized and analyzed through a software program, hierarchical processing is carried out, and then partition processing is carried out or partition processing is carried out, then hierarchical processing is carried out, and discrete two-dimensional layer information is obtained; (3), through the path planning process, a scanning path of the obtained discrete two-dimensional layer information is planned, and according to scanned outline information, forming head scanning paths with two kinds of precision can be respectively planned; (4) according to the outline information of each layer of scanning, a conventional precision forming head needle rapidly performs filling on the interior, a high-precision forming head needle performs high-precision filling on the surface of the outline, and the filling manufacturing work of each layer can be jointly completed by the conventional precision forming head needle and the high-precision forming head needle; (5) layer-by-layer printing is carried out; (6) the working process of the step (4) and the working process of the step (5) are repeated until all printing work is completed, and a workpiece is taken out; (7) aftertreatment is carried out on the taken-out workpiece.

A life-components oriented financial planning system comprises a timeline planning interface module for generating an interface comprising a plurality of histograms representing a planning target's “life components”; a projection generation module comprising projection generation formulae, wherein the entire projection data form the projection set of a “life road”; a financial destiny chart module for creating financial destiny charts from projection data in projection sets. Each life component comprises four kinds of “projections”, income, expenses, assets and liabilities. The position and length of the histogram represent values of a corresponding life component. The planning target's life road comprises life components; life components are grouped by financial modules and formed from projections; the projection comprises items. The present invention can strengthen trust in the planning process, making a planning target input more personal data to plan for himself or herself. The status the system simulates becomes clearer as more information is provided.

The invention discloses a multi-target distribution and flight path planning method for multiple rescue helicopters, which relates to the technical field of aviation emergency rescue. The method comprises the steps of evaluating aviation rescue task execution feasibility, conducting disaster area map image processing, obtaining a feasibility matrix through the evaluation of the rescue task execution feasibility, taking the feasibility matrix as a coefficient matrix for a solution matrix Xij, solving distribution results according to tasks of different quantities of the rescue helicopters and target points through a Hungary algorithm, obtaining a flight path solution space by extracting a safety zone topological structure by adopting an image processing method and morphological characteristics, obtaining the shortest path in the flight path solution space by a heuristic A* search algorithm, combining the results of multi-target distribution for multiple rescue helicopters, forming an emergency plan for rescue task execution of the helicopters, and calling a Google Earth flight simulation API (Application Program Interface) to demonstrate the emergency rescue plan and making preflight preparation, so as to improve the efficiency and safety of the aviation emergency rescue. The method is simple, the time complexity is low, the flight path planning process is visual, and the result is distinct.

A method of establishing a new category in enterprise marketing planning (EMP) comprising of a self-contained, integrated, stand-alone system with three interconnecting subsidiary systems: Enterprise Market Planning (EMP) Modules, Competitor Signalling Environment (CSE) Portal and EMP Project Management (PMO) System through which integration of operational with market planning data and processes at strategic and/or corporate planning levels may provide enhanced market competitiveness to emerging brand and emerging market companies without sufficiently deep process/systems integration knowledge, experience and capabilities a business mission-critical central data integration and messaging system with built-in content, formats, rules, and processes to enable the optimisation of business strategies within existing Enterprise Resource Planning systems (ERP) through strategic intervention of the Enterprise Market Planning system (EMP), wherein the EMP System is configured to reduce the lack of convergence between operational and market planning processes for improved investment prioritisation in competitive market and brand performance an integrated, modular, and content-rich enterprise market planning system designed to accelerate organisational learning, collaboration and competencies in market and brand competitiveness processes from market and customer knowledge to communications and technology alignment, market performance measures, rules and formats via a single, unified data access and retrieval point and an integrated business information management system that may shape essential market and brand convergence behaviours enterprise-wide among assigned users within emerging brand and/or emerging market enterprises seeking to align business activities, investments, systems and competencies in the building of stronger and more globally-competitive corporate, product and service brands.

A system and method for dynamically allocating human resources to a project plan is provided. Audit data associated with legacy planning processes may be analyzed in order to estimate an amount of work effort, a cost, or other information associated with various resources (e.g., the resource may be assigned a relative value based on skills maturity, experience, overall repertoire, or other factors). As such, a more accurate assessment of a given project plan may be created, thereby providing various advantages, such as minimizing risks, improving confidence in estimates or proposals, improving return on investment calculations, maximizing profitability per project, or effectively identifying which projects should be allocated to skilled workers, entry level or lower skilled workers, or otherwise.

The invention provides an electric automobile traveling path planning method based on a driving working condition. The electric automobile traveling path planning method comprises the following steps:step 1: determining a starting point and a finishing point; loading road network information, an average speed of each road section, uphill information of each road section and road section congestion information; setting a default initial speed v0 of an automobile vehicle; automatically detecting current residual total energy of an the electric automobile by a system; step 2, planning a shortestpath L0 according to the starting point and the finishing point by utilizing a shortest path Dijkstra algorithm; step 3, carrying out energy consumption analysis on the L0, calculating total energy consumption and judging whether the total energy consumption can reach or not, wherein the energy consumption analysis is divided into energy consumption of next 2 kilometers in the future, energy consumption from a residual road section of to the finishing point and extra energy consumption caused by uphill. According to the electric automobile traveling path planning method provided by the invention, a charging pile and the road network information of a road are effectively combined; a driving process considers the average speed which is dynamically calculated and a road grade which are dynamically calculated, and an electric automobile traveling path planning process is finished relatively well; a route can be more accurately planned for a user.

The invention discloses a low-orbit satellite routing strategy method based on a deep reinforcement learning architecture, and belongs to the field of wireless communication. Firstly, an iridium constellation network is established, and a deep reinforcement learning framework is established in combination with a Markov decision process; and for a certain satellite node A, a HELLO packet is periodically sent to a neighbor node, and an adjacent node communicated with the link state of the current node A is searched, a next hop node of a current node is obtained by inputting a destination node coordinate, a link state of the current node and a link state of a neighbor node into a deep reinforcement learning architecture, and a next hop node is continuously obtained in the same way; and when aspecial routing condition (such as open circuit, loop and congestion) occurs, a link state is repeatedly input into the deep reinforcement learning architecture by adopting a corresponding solution strategy until a destination node is reached, and a path planning process is finished. According to the method, the system complexity and the storage overhead are reduced, the effect of detecting the satellite link state in real time is achieved, and satellite routing is more stable and reliable.

The invention discloses a spacecraft assembly oriented three-dimensional structured process design system and method. The three-dimensional structured process design system comprises a process planning management module, a process digital prototype associated management module, a process compiling module, a process controlled and publishing module. The process planning management module is used for planning process volumes and a process route and establishing a process file structure tree; the process digital prototype associated management module is used for being associated to the process file structure tree and a product structure tree provided by a process digital prototype; the process compiling module is used for allocating materials, tooling, tools and auxiliary resources, compiling process sequences and generating a working procedure route map; the process controlled and publishing module is used for initiating a process approval flow and publishing process files to a field manufacturing execution system. By the spacecraft assembly oriented three-dimensional structured process design system and method, the process digital prototype is taken as a unique data source, close association between the process file structure tree and the product structure tree is realized, and process compiling efficiency is improved by taking typical process statements as templates.

The invention relates to a speed planning method during NURBS curve interpolation of an industrial robot. The method comprises that (1) a characteristic equation, based on a parameter u and a feed velocity v, of an NURBS curve is established; (2) a velocity constraint relation, based on the geometrical constraints as centripetal acceleration and chord-height error, of the NURBS curve is established; and (3) according to the fact that the feed speed in the robot end changes monotonously, predictive speed segmentation is carried out on the NURBS curve to obtain a segment point interpolation parameter set, and a speed planning process is completed. The speed planning method is especially suitable for the NURBS curve in which multiple teaching points are known, a movement track of the robot end needs to be smooth, and the movement speed and acceleration of the robot end cannot change abruptly; the geometric characteristics of the NURBS curve are taken into consideration when speed limitation is established; the curve is segmented predictively according to the monotonicity of speed change; and impact on the robot during NURBS curve interpolation is greatly reduced.

The invention relates to an improved S curve acceleration and deceleration control method based on a trigonometric function and belongs to the motion control field. According to the method, a curve isdivided into stages according to different motion characteristics, in the planning process, whether each stage exists is discussed through parameter restriction and actual situations to acquire the operation time of each stage, and a displacement curve after planning is acquired. On the basis of acceleration and deceleration of a traditional S curve, the acceleration and deceleration control method based on the trigonometric function is introduced, acceleration and deceleration continuity can be effectively guaranteed, and impact on numerical control equipment is reduced to the maximum degree.

The invention discloses a path planning determining method based on cladogram topological road network construction, which comprises the steps of: obtaining city complete road network data, constructing a road network full-connected graph G expressing original geographic information by applying an adjacent topological cladogram; classifying and dividing the road network full-connected graph G into a Y-type road network topological cladogram; obtaining the minimal branching tree comprising all target nodes; and eliminating invalid branching nodes by adopting a branching delimiting searching strategy for the minimal branching tree comprising all target nodes in a road planning problem, reducing incidence matrix dimensionality and obtaining a planning result. The invention has the advantagesof optimizing algorithm complexity of the road planning process and improving road planning efficiency.