378 results about "Configuration space" patented technology

This disclosure describes an implantable medical electrical lead and an ICD system utilizing the lead. The lead includes a lead body defining a proximal end and a distal portion, wherein at least a part of the distal portion of the lead body defines an undulating configuration. The lead includes a defibrillation electrode that includes a plurality of defibrillation electrode segments disposed along the undulating configuration spaced apart from one another by a distance. The lead also includes at least one electrode disposed between adjacent sections of the plurality of defibrillation sections. The at least one electrode is configured to deliver a pacing pulse to the heart and/or sense cardiac electrical activity of the heart.

A method is provided comprising: enumerating a group of available virtual functions corresponding to the physical function; mapping the group of available virtual functions to a non-transparent port of the switch by creating a copy of a configuration space for the physical function while assigning unique vendor and device identifications for different classes of devices, wherein the mapping creates a pseudo physical function exposing a subset of the SR-IOV capability from the configuration space for the physical function; receiving a request to access the physical function from the single host; and providing the pseudo physical function to the single host for loading on the single host, in response to the receiving of the request, wherein the pseudo physical function is designed to call management functions of the single host to enable the group of available virtual functions in a local hierarchy of the single host.

The invention relates to a track planning method of a redundant space mechanical arm for on-track catching. The catching operation of the space mechanical arm is divided into a rough catching stage and a fine catching stage, so that problems are simplified. By aiming at outstanding problems of different stages, different planning algorithms are adopted. In the rough catching stage, a track searching algorithm based on configuration space is adopted, and the algorithm is based on the test in the configuration space; and in the fine catching stage, a pseudo-inverse algorithm based on kinematics is adopted, and the final precise catching is guaranteed by compensating the relative movement of a target.

The planting arm of the direct-taking wide-narrow row splitting mechanism belongs to agricultural machinery; the planting arm includes a planting arm shell and a cam fitted on the planting arm shell, a shift fork shaft, a shift fork, a seedling pusher and a seedling claw, and the cam The cam axis and the shifting fork axis of the shifting fork shaft are arranged in a space staggered angle, through the space staggered angle, the pusher bar and the seedling claws are perpendicular to the rice transplanter seedling door, and the pusher bar and the seedling claws are aligned with each other. The working direction of the rice transplanter is parallel; the planting arm realizes the operation of wide and narrow rows to form rectangular seedling blocks when picking seedlings, and the two sides of the claws act on the seedling blocks at the same time, and the seedlings are vertical when transplanting. The structure is simple and reasonable, and the operation quality is good. features.

An embodiment of the invention provides a path planning method for robot fast collision avoidance. The method comprises using a BBRrt algorithm and a collision detection algorithm based on the convex set theory, extending alternatively from initial configuration and target configuration to opposite configuration form two balance RRT trees, quickly finding, in a configuration space, a collision-free motion path connecting the initial configuration and the target configuration, effectively passing through a narrow channel and avoiding collision with obstacles in the environment, making full use of a multi-step expansion method and a balance extension method with an inspiring purpose, and thus effectively improving the convergence and repeatability of the RRT algorithm. Based on the convex set theory, a convex hull fast collision detection algorithm constituted by a linear inequation group is provided, and the efficiency and performance of a collision detection module in the path planning method for collision avoidance can be improved. The method provided by the invention can be extended to high-dimensional robot multi-tree RRT path planning.

Disclosed are a path planning apparatus of a robot, which generates a path plan to control movements of the robot, and a method thereof. An improved RRT algorithm is employed, when a tree is extended in a configuration space so as to satisfy a constraint, and thus steeply bent or roundabout portions of the tree are reduced.

A method of dividing a coverage area of a robot and a device for the same. That is, a method of producing a space map for a robot to work and dividing the space map into at least one segment and a device for the same. The method includes producing an occupancy grid map composed of grid points that are probabilistically distributed by sensing a distance from an obstacle, producing a configuration space map by increasing the thickness of an obstacle and a wall in the occupancy grid map on the basis of the radius and size of the robot, and dividing an area by sweeping the area with a band-typed slice in the configuration space map.

In an interconnect apparatus for interconnecting at least one host to at least a plurality of presentation registers provide a presentation interface for the device to the host. The interconnect apparatus includes memory for holding the presentation registers and a governor operable to manage the presentation registers in the memory.

An apparatus, method and computer-readable medium planning a path of a robot by planning an optimal path while satisfying a dynamic constraint. In a process of searching for a motion path from a start point to a goal point while extending a tree from a start point of a configuration space to generate a path, along which a manipulator of the robot is moved in order to perform a task, an optimal path is generated responsive to the dynamic constraint of the manipulator of the robot to generate stable motion satisfying momentum and Zero Moment Position (ZMP) constraint. Accordingly, path planning performance is improved and a path satisfying a kinematic constraint and a dynamic constraint is rapidly obtained.

A system and method for knowledge based development of interior models for configurable spaces, including storing a digital definition of the interior section of the passenger vehicle and parameters related to the objects, storing a digital definition of a plurality of three dimensional stay-out spaces associated with one or more of the objects, defining one or more collision rules between a first three dimensional stay-out space and a second three dimensional stay-out space, the rules define whether the first three dimensional stay-out space and the second three dimensional stay-out space may overlap, and designing the interior section to accommodate objects based on the defined collision rules and object parameters.

A large convoluted space, such as a multi-story concourse of an airport is isolated and a chemical or biological agent in the concourse is deactivated. A plurality of deactivation gas sources (100) introduce a deactivation gas at multiple points along the concourse. Fans (66, 106) circulate the deactivation gas, sensors (110) sense concentrations of the deactivation gas at numerous points around the concourse and exhaust fans (66) exhaust air, spent deactivation gas, and some deactivation gas. A control processor (84) controls the generators, the circulation fans, and the exhaust fans in accordance with the gas concentrations sensed by the sensors to increase and decrease deactivation gas concentration in selected subregions of the concourse by increasing or decreasing generation, increasing or decreasing exhausting, or altering flow patterns among subregions.

A system and method for registering combinations of physical and/or virtual functions for configuring an endpoint are provided. With the system and method, a mechanism informs a management component of a multifunction endpoint's functional combinations. The management component may then use this information to select the functional combinations that are to be made visible to each system image. The informing of the management component may be performed by writing values to various predefined fields in a configuration space for a physical or virtual function that provides information regarding the number of virtual functions supported, the combination of functions supported, a nominal combination of virtual functions to be used by the physical function, and a group identifier for identifying which functions are linked in a combination grouping.

The invention provides a shifting register, a GOA circuit, a driving method thereof and a display device, belonging to the technical field of display. The invention aims to solve the problem of further prompting the low stability and low power consumption of the present GOA circuit. The shifting register comprises a plurality of input modules, a plurality of output modules, a first noise reduction module and a second noise reduction module, wherein the shifting register has a plurality of output control points due to the existence of the plurality of input modules, so that the switch-on/off of multiple rows of grid lines can be controlled, the driving control capability of a single-pole shifting register can be promoted and the configuration space of the shifting register can be effectively saved; besides, the output modules respectively control the pull-down nodes through the feedback of the noise reduction modules, so that the anti-noise capability of the circuit can be obviously increased and the output is relatively smooth; the panel yield is greatly increased; the shifting register provided by the invention is suitable for various display devices.

Disclosed herein are a path planning apparatus and a method for a robot to plan an optimal path along which a manipulator of a robot moves to a goal point from a start point. An obstacle within a prescribed angle on a straight line connecting a start point and a goal point is recognized as a middle point in a configuration space and arbitrary points separated from the middle point by a prescribed distance are selected. Among the selected points, arbitrary points which can directly connect the start point and the goal point without passing the obstacle are selected as waypoints to map a new middle node. A path is extended via the middle node and extension of a tree in a wrong direction is minimized so that the manipulator is not struck at local minima without depending greatly on a goal score, thereby improving the performance of path planning and rapidly searching for a path.

A Web-based system and method uses a model of the manufacturing setup and knowledge of a designed part with arbitrary geometry to produce process plans in two successive stages. First, the part geometry is analyzed. A query of determining the maximal volume machinable from an oriented machining tool is transformed into determining the visibility of the part surface from the perspective of a hypothetical camera placed at the tip of the oriented machining tool. Second, a collection of the maximal machinable volumes over the set of all tool orientations is collected. Combinations of the maximal machinable volumes covering the entire difference between the raw stock and the desired part are evaluated for providing feedback on manufacturability and process plans. In a further embodiment, manufacturability is analyzed for tools and machines with arbitrary geometric complexity using high dimensional configuration space analysis.

Inconsistencies between configuration rules represent a significant concern when modeling a product using configuration rules. The consistency checking system approaches a configuration model from the perspective of a sets of features and families. The configuration space of a model represents the entire set of all combinations of selections within a configuration model. The consistency checking system operates on subsets of the configuration space by consolidating data within the configuration space into minimized subsets that represent a portion of the configuration space where a particular consistency error can occur. Thus, the contents of each subset vary depending upon which consistency error is being checked, and consistency checking is performed on reduced subsets determined on an error by error basis rather than on the configuration space as a whole.

Embodiments herein may enable an algorithmic pattern generator (APG) to present iterative values of one or more operational parameters to a device under test (DUT). At each iteration, one or more test patterns may be presented to the DUT. The APG may capture test results from a set of iterations of the operational parameters. The APG may also write values associated with a next operational parameter to be iterated to a test parameter configuration space within the device tester.

A distributed PCIe adapted to support a hot-plug process triggered by any change in a status of a distributed link, comprises an upstream bus unit including a first bridge connected to a root component and adapted to maintain a first configuration space and a copy of a second configuration space, the first configuration space bridge includes at least hot-plug registers specifying at least capabilities and status of a slot of the first bridge; and a second bridge connected to an endpoint component and adapted to maintain the second configuration space, the second configuration space includes at least hot-plug registers specifying at least capabilities and status of a slot of the second bridge.