The article presents the path planning algorithm to be applied in the Chinese chess game, and uses multiple mobile robots to present the experimental scenario. Users play the Chinese chess game using the mouse on the ...The article presents the path planning algorithm to be applied in the Chinese chess game, and uses multiple mobile robots to present the experimental scenario. Users play the Chinese chess game using the mouse on the supervised computer. The supervised computer programs the motion paths using A＊ searching algorithm, and controls mobile robots moving on the grid based chessboard platform via wireless radio frequency （RF） interface. The A＊ searching algorithm solves shortest path problems of mobile robots from the start point to the target point, and avoids the obstacles on the chessboard platform. The supervised computer calculates the total time to play the game, and computes the residual time to play chess in the step for each player. The simulation results can fired out the shortest motion paths of the mobile robots （chesses） moving to target points from start points in the monitor, and decides the motion path to be existence or not. The eaten chess can moves to the assigned position, and uses the A＊ searching algorithm to program the motion path, too. Finally, the authors implement the simulation results on the chessboard platform using mobile robots. Users can play the Chinese chess game on the supervised computer according to the Chinese chess game rule, and play each step of the game in the assigned time. The supervised computer can suggests which player don＇t obey the rules of the game, and decides which player to be a winner. The scenario of the Chinese chess game feedback to the user interface using the image system.展开更多
A new algorithm is proposed for underwater vehicles multi-path planning. This algorithm is based on fitness sharing genetic algorithm, clustering and evolution of multiple populations, which can keep the diversity of ...A new algorithm is proposed for underwater vehicles multi-path planning. This algorithm is based on fitness sharing genetic algorithm, clustering and evolution of multiple populations, which can keep the diversity of the solution path, and decrease the operating time because of the independent evolution of each subpopulation. The multi-path planning algorithm is demonstrated by a number of two-dimensional path planning problems. The results show that the multi-path planning algorithm has the following characteristics: high searching capability, rapid convergence and high reliability.展开更多
The article presents multi-pattern formation exchange of mobile robots according to the image signals, programs motion paths using A＊ searching algorithm, and avoids the collision points of motion paths. The system c...The article presents multi-pattern formation exchange of mobile robots according to the image signals, programs motion paths using A＊ searching algorithm, and avoids the collision points of motion paths. The system contains an image system, a grid based motion platform, some wireless Radio Frequency （RF） modules and five mobile robots. We use image recognition algorithm to classify variety pattern formation according to variety Quick Response （QR） code symbols on the user interface of the supervised computer. The supervised computer controls five mobile robots to execute formation exchange and presents the movement scenario on the grid based motion platform. We have been developed some pattern formations according to game applications, such as long snake pattern formation, phalanx pattern formation, crane wing pattern formation, sword pattern formation, cone pattern formation, sward pattern tbrmation, T pattern formation, rectangle pattern formation and so on. We develop the user interface of the multi-robot system to program motion paths for variety pattern formation exchange according to the minimum displacement. In the experimental results, the supervised computer recognizes the various QR-code symbols using image system and decides which pattern formation to be selected on real-time. Mobile robots can receive the pattern formation command from the supervised computer, present the movement scenario from the original pattern formation to the assigned pattern formation on the motion platform, and avoid other mobile robots on real-time.展开更多
A k-shortest path based algorithm considering layout density and signal integrity for good buffer candidatelocations is proposed in this paper. Theoretical results for computing the maximal distance betweenbuffers are...A k-shortest path based algorithm considering layout density and signal integrity for good buffer candidatelocations is proposed in this paper. Theoretical results for computing the maximal distance betweenbuffers are derived under the timing, noise and slew rate constraints. By modifying the traditional uniformwire segmenting strategy and considering the impact of tile size on density penalty function, this work proposesk-shortest path algorithm to find the buffer insertion candidate locations. The experiments show thatthe buffers inserted can significantly optimize the design density, alleviate signal degradation, save thenumber of buffers inserted and the overall run time.展开更多
An effective and more efficient path planning algorithm is developed for a kinematically non-redundant free-floating space robot(FFSR) system by proposing a concept of degree of controllability(DOC) for underactuated ...An effective and more efficient path planning algorithm is developed for a kinematically non-redundant free-floating space robot(FFSR) system by proposing a concept of degree of controllability(DOC) for underactuated systems. The DOC concept is proposed for making full use of the internal couplings and then achieving a better control effect, followed by a certain definition of controllability measurement which measures the DOC, based on obtaining an explicit and finite equivalent affine system and singular value decomposition. A simple method for nilpotent approximation of the Lie algebra generated by the FFSR system is put forward by direct Taylor expansion when obtaining the equivalent system. Afterwards, a large-controlla- bility-measurement(LCM) nominal path is searched by a weighted A* algorithm, and an optimal self-correcting method is designed to track the nominal path approximately, yielding an efficient underactuated path. The proposed strategy successfully avoids the drawback of inefficiency inherent in previous path-planning schemes, which is due to the neglect of internal couplings, and illustrative numerical examples show its efficacy.展开更多
In this paper, we study the kinematic mechanism and path planning for a two-caster nonholonomic vehicle (the Essboard) which is a recent variant of skateboard. Different from the most studied Snakeboard, the Essboard ...In this paper, we study the kinematic mechanism and path planning for a two-caster nonholonomic vehicle (the Essboard) which is a recent variant of skateboard. Different from the most studied Snakeboard, the Essboard consists of a torsion bar and two platforms, each of which contains a pedal and a caster. We first investigate the relationship between the tilt angles of the pedals and the wheel directions of the casters. This relationship reveals how to control the wheel directions by adjusting the tilt angles. Next, the rotational radius of the Essboard is derived for a given pair of tilt angles of both pedals. The rotational radius of the Essboard is much different than that of the Snakeboard. Then we develop a path-planning algorithm for the Essboard to move from a start position to the goal, using a series of consecutively connected arcs, which are tangent to each other at the connected points. It is shown from a kinematic point of view that the path planning of the Essboard can be solved by a series of pairs of pedals' tilt angles. Three experiments are conducted to confirm the correctness of the main results. The results in this paper are a foundation for further study of the Essboard.展开更多
Variable feedrate interpolation algorithms for five-axis parametric toolpath are very promising but still rather limited currently.In this paper,an off-line feedrate scheduling method of dual NURBS curve is presented ...Variable feedrate interpolation algorithms for five-axis parametric toolpath are very promising but still rather limited currently.In this paper,an off-line feedrate scheduling method of dual NURBS curve is presented with geometric and kinematical constraints.For a given dual parametric curve,the feedrates of sampling points are first scheduled sequent with confined feedrate of cutter tip and machine pivot,chord error,normal acceleration and angular feedrate.Then,the feedrate profiles of angular feed acceleration sensitive regions of the path are adjusted using a bi-directional scanning algorithm.After that,a linear programming method is used to adjust the feedrate profiles of linear feed acceleration sensitive regions and control the linear feed acceleration of both cutter tip and machine pivot within preset values.Further,a NURBS curve is used to fit the feedrates of sampling points.Finally,illustrative examples are carried out to validate the feasibility of the proposed feedrate scheduling method.The results show that the proposed method has the ability of effectively controlling the angular feed characters of cutter axis as well as the chord error and linear feed characters of cutter tip and machine pivot,and it has potential to be used in high accuracy and high quality five-axis machining.展开更多
文摘The article presents the path planning algorithm to be applied in the Chinese chess game, and uses multiple mobile robots to present the experimental scenario. Users play the Chinese chess game using the mouse on the supervised computer. The supervised computer programs the motion paths using A＊ searching algorithm, and controls mobile robots moving on the grid based chessboard platform via wireless radio frequency （RF） interface. The A＊ searching algorithm solves shortest path problems of mobile robots from the start point to the target point, and avoids the obstacles on the chessboard platform. The supervised computer calculates the total time to play the game, and computes the residual time to play chess in the step for each player. The simulation results can fired out the shortest motion paths of the mobile robots （chesses） moving to target points from start points in the monitor, and decides the motion path to be existence or not. The eaten chess can moves to the assigned position, and uses the A＊ searching algorithm to program the motion path, too. Finally, the authors implement the simulation results on the chessboard platform using mobile robots. Users can play the Chinese chess game on the supervised computer according to the Chinese chess game rule, and play each step of the game in the assigned time. The supervised computer can suggests which player don＇t obey the rules of the game, and decides which player to be a winner. The scenario of the Chinese chess game feedback to the user interface using the image system.
文摘A new algorithm is proposed for underwater vehicles multi-path planning. This algorithm is based on fitness sharing genetic algorithm, clustering and evolution of multiple populations, which can keep the diversity of the solution path, and decrease the operating time because of the independent evolution of each subpopulation. The multi-path planning algorithm is demonstrated by a number of two-dimensional path planning problems. The results show that the multi-path planning algorithm has the following characteristics: high searching capability, rapid convergence and high reliability.
文摘The article presents multi-pattern formation exchange of mobile robots according to the image signals, programs motion paths using A＊ searching algorithm, and avoids the collision points of motion paths. The system contains an image system, a grid based motion platform, some wireless Radio Frequency （RF） modules and five mobile robots. We use image recognition algorithm to classify variety pattern formation according to variety Quick Response （QR） code symbols on the user interface of the supervised computer. The supervised computer controls five mobile robots to execute formation exchange and presents the movement scenario on the grid based motion platform. We have been developed some pattern formations according to game applications, such as long snake pattern formation, phalanx pattern formation, crane wing pattern formation, sword pattern formation, cone pattern formation, sward pattern tbrmation, T pattern formation, rectangle pattern formation and so on. We develop the user interface of the multi-robot system to program motion paths for variety pattern formation exchange according to the minimum displacement. In the experimental results, the supervised computer recognizes the various QR-code symbols using image system and decides which pattern formation to be selected on real-time. Mobile robots can receive the pattern formation command from the supervised computer, present the movement scenario from the original pattern formation to the assigned pattern formation on the motion platform, and avoid other mobile robots on real-time.
基金Supported by the National Key Project of Scientific and Technical Supporting Programs (No. 2006BAK07B04).
文摘A k-shortest path based algorithm considering layout density and signal integrity for good buffer candidatelocations is proposed in this paper. Theoretical results for computing the maximal distance betweenbuffers are derived under the timing, noise and slew rate constraints. By modifying the traditional uniformwire segmenting strategy and considering the impact of tile size on density penalty function, this work proposesk-shortest path algorithm to find the buffer insertion candidate locations. The experiments show thatthe buffers inserted can significantly optimize the design density, alleviate signal degradation, save thenumber of buffers inserted and the overall run time.
基金supported by the National Natural Science Foundation of China(Grant No.11272027)
文摘An effective and more efficient path planning algorithm is developed for a kinematically non-redundant free-floating space robot(FFSR) system by proposing a concept of degree of controllability(DOC) for underactuated systems. The DOC concept is proposed for making full use of the internal couplings and then achieving a better control effect, followed by a certain definition of controllability measurement which measures the DOC, based on obtaining an explicit and finite equivalent affine system and singular value decomposition. A simple method for nilpotent approximation of the Lie algebra generated by the FFSR system is put forward by direct Taylor expansion when obtaining the equivalent system. Afterwards, a large-controlla- bility-measurement(LCM) nominal path is searched by a weighted A* algorithm, and an optimal self-correcting method is designed to track the nominal path approximately, yielding an efficient underactuated path. The proposed strategy successfully avoids the drawback of inefficiency inherent in previous path-planning schemes, which is due to the neglect of internal couplings, and illustrative numerical examples show its efficacy.
基金supported by the National Natural Science Foundation of China (Grant Nos. 51105012 and 61175079)
文摘In this paper, we study the kinematic mechanism and path planning for a two-caster nonholonomic vehicle (the Essboard) which is a recent variant of skateboard. Different from the most studied Snakeboard, the Essboard consists of a torsion bar and two platforms, each of which contains a pedal and a caster. We first investigate the relationship between the tilt angles of the pedals and the wheel directions of the casters. This relationship reveals how to control the wheel directions by adjusting the tilt angles. Next, the rotational radius of the Essboard is derived for a given pair of tilt angles of both pedals. The rotational radius of the Essboard is much different than that of the Snakeboard. Then we develop a path-planning algorithm for the Essboard to move from a start position to the goal, using a series of consecutively connected arcs, which are tangent to each other at the connected points. It is shown from a kinematic point of view that the path planning of the Essboard can be solved by a series of pairs of pedals' tilt angles. Three experiments are conducted to confirm the correctness of the main results. The results in this paper are a foundation for further study of the Essboard.
基金supported by the National Natural Science Foundation of China under Grant Nos.51075054 and 11290143the National Basic Research Program of China under Grant No.2011CB716800
文摘Variable feedrate interpolation algorithms for five-axis parametric toolpath are very promising but still rather limited currently.In this paper,an off-line feedrate scheduling method of dual NURBS curve is presented with geometric and kinematical constraints.For a given dual parametric curve,the feedrates of sampling points are first scheduled sequent with confined feedrate of cutter tip and machine pivot,chord error,normal acceleration and angular feedrate.Then,the feedrate profiles of angular feed acceleration sensitive regions of the path are adjusted using a bi-directional scanning algorithm.After that,a linear programming method is used to adjust the feedrate profiles of linear feed acceleration sensitive regions and control the linear feed acceleration of both cutter tip and machine pivot within preset values.Further,a NURBS curve is used to fit the feedrates of sampling points.Finally,illustrative examples are carried out to validate the feasibility of the proposed feedrate scheduling method.The results show that the proposed method has the ability of effectively controlling the angular feed characters of cutter axis as well as the chord error and linear feed characters of cutter tip and machine pivot,and it has potential to be used in high accuracy and high quality five-axis machining.
