221results about How to "Optimization path" patented technology

The invention discloses a mobile robot path planning method based on an improvement of an ant colony algorithm and particle swarm optimization. The method mainly solves the problems that in the prior art, the operating speed of an algorithm is low, and frequency of turning of an optimized path is high. The planning method includes the steps that modeling is carried out on a work environment of a robot; the particle swarm optimization is utilized to quickly carry out path planning, pheromones more than those around an obtained path are scattered on the obtained path, and guiding is provided for an ant colony; an ant colony algorithm optimized by the principle of inertia is adopted, and optimization is conducted on the basis of the particle swarm optimization; the motion path of the robot is output according to an optimization result. According to the planning method, comprehensive consideration is given to stability and robustness of the algorithm, iterations can be effectively reduced, searching efficiency is improved, the path length is shortened, the frequency of turning is reduced, path quality is substantially improved, and the planning method accords with an artificial planning intention and is suitable for autonomous navigation of various mobile robots in a static environment.

A catheter adapted for ablation, mapping, injection, and directional control by an external magnetic system has a catheter body, an intermediate section, and a tip section having a tip electrode configured with an omnidirectional distal end and a concentric needle port. The tip electrode houses a magnetic device and a position sensor arranged in an integrated configuration, wherein the configuration facilitates a path in the tip section for a component, including an injection needle, to extend through the tip section for extension and retraction with reduced stress and friction. The integrated configuration is an efficient use of space in the tip electrode that allows the tip section to carry both the position sensor for determining location and orientation of the tip section and the necessary volume of magnetic or magnetizable material to accomplish magnetic navigation. The catheter also includes a very soft and flexible intermediate section and an even softer and more flexible distal transitional section carrying additional magnetic members to facilitate remote magnetic navigation.

The invention discloses an apple picking machine and a method for operating the same. The apple picking machine comprises a framework, a shearing mechanism, an adjusting mechanism, a collecting channel, an accommodating mechanism and an apple box. The adjusting mechanism comprises a support column, a rotary column and a crank-slider mechanism; the bottom of the support column sleeves a base, and the top of the support column is hinged to an end of the rotary column; the crank-slider mechanism comprises a slider and a connecting rod, the slider sleeves the rotary column, one end of the connecting rod is hinged to the rotary column, and the other end of the connecting rod is hinged to the support column; the shearing mechanism is arranged on the top of the rotary column. The apple picking machine and the method have the advantages that the height of shears can be conveniently controlled via the crank-slider mechanism, and the apple picking machine can be controlled via motors and is simple in operation and low in labor intensity; an electromagnet is arranged at the tail of a handle of the shears, so that the apple picking machine can be conveniently manually operated, and the labor intensity can be reduced; the apple picking machine is provided with the collecting channel, so that apples can be conveniently collected while bruise due to an accommodating machine can be effectively prevented; the apples can be automatically placed by the accommodating mechanism which is matched with the apple box, and accordingly the labor time can be saved.

The present invention provides a safe path planning method including a process of using a grid map and a congestion map, and a process of planning a path of a mobile robot using a cost function.

The present invention provides a safe path planning method including a process of using a grid map and a congestion map, and a process of planning a path of a mobile robot using a cost function.

The invention discloses a stereo logistics system access cargo path optimization control system and a method. The stereo logistics system access cargo path optimization control system comprises a monitoring upper computer, a programmable logic controller (PLC) module and an embedded motion controller, wherein an input end of the PLC module is connected with a plurality of cargo arrival detection sensors and a plurality of cargo position detection sensors, and an output end of the PLC module is connected with a plurality of frequency converters and a plurality of contactors. An input end of the embedded motion controller is connected with a piler state detection sensor, and an output end of the embedded motion controller is connected with an X-axis servo motor driver, a Y-axis servo motor driver and a Z-axis stepper motor driver. The method comprises the following steps: a logistics task signal is input, the upper computer is monitored to conduct path optimization, and the embedded motion controller and the PLC module respectively control the piler and a cargo conveying line to execute corresponding logistics tasks. The stereo logistics system access cargo path optimization control system and the method are reasonable in design, convenient and fast to use and operate, high in control precision, reliable in working reliability and stability, high in logistics efficiency, strong in practicability and high in popularization and application values.

A turbomachine includes a high-pressure spool, an axial compressor of axis X mounted on a rotor and including a casing and at least one rear bearing disposed between the casing and the rotor of the compressor. The turbomachine further includes an electricity generator coaxial with the spool and including a primary magnetic circuit that is constrained to rotate with the rotor of the compressor and a secondary magnetic circuit that is secured to the casing. The electricity generator is disposed upstream from the rear bearing and includes at least a first cooling circuit surrounding the secondary magnetic circuit and extended by a nozzle for lubricating the rear bearing.

An electronic package which includes a substrate (e.g., a chip carrier substrate or a PCB), an electronic component (e.g., a semiconductor chip), a heatsink and a thermal interposer for effectively transferring heat from the chip to the heatsink. The interposer includes a compressible, resilient member (e.g., an elastomeric pad) and a plurality of thin, metallic sheets (e.g., copper foils) and the thickness thereof can be adjusted by altering the number of such foils.

For use with a path vector routing protocol, a system and method for increasing alternative network route convergence speed and a border gateway router incorporating the system or the method. In one embodiment, the system includes: (1) a router information base (RIB) data receiver, associated with a network, that receives RIB data including: (1a) an update of an active route to a domain in the network that causes the active route to become a withdrawn route and (1b) indications, based on loopback addresses associated with nodes through which the withdrawn route passed, of a reachability of the each of the nodes and (2) route disqualification logic, associated with the RIB data receiver, that disqualifies alternative routes to the domain based on the indications.

A technique computes a traffic engineering (TE) label switched path (LSP) that spans multiple domains of a computer network from a head-end node of a local domain to a tail-end node of a remote domain. The novel inter-domain TE-LSP computation technique comprises a computation algorithm executed by the head-end node, which utilizes Path Computation Elements (PCEs) located within the remote domains (i.e., other than the local domain). Specifically, the head-end node requests path segments from a PCE in each of the remote domains, in which the path segments represent paths between all entry border routers to either all exit border routers of the particular remote domain (i.e., through the domain), or to the tail-end node. Upon receiving path segments from each remote domain, the head-end node combines the path segments with local domain information, and performs a forward path computation from the head-end node to the tail-end node to find the best (i.e., “shortest”) path.