The spectrum allocation for links in multi-hop cognitive radio networks is addressed.The links rent the vacant licensed bands offered by primary users for implementing directional transmission.To minimize the individu...The spectrum allocation for links in multi-hop cognitive radio networks is addressed.The links rent the vacant licensed bands offered by primary users for implementing directional transmission.To minimize the individual cost,the links share the licensed band and rental fee.An interference model for the directional transmission in cognitive radio networks is proposed to formulate the cooperative and dynamic behavior of the links using the theory of hedonic game,called spectrum allocation game.The game is proved to converge to the core stable state indicating that all links satisfy with their current conditions and do not deviate from their coalitions.Numerical results show that the game improves spectral efficiency and contributes to reducing the individual cost of the links.展开更多
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.展开更多
基金Supported by the National High Technology Research and Development Programme of China(No.2011AA010503)the National Natural Science Foundations of China(No.60903192)
文摘The spectrum allocation for links in multi-hop cognitive radio networks is addressed.The links rent the vacant licensed bands offered by primary users for implementing directional transmission.To minimize the individual cost,the links share the licensed band and rental fee.An interference model for the directional transmission in cognitive radio networks is proposed to formulate the cooperative and dynamic behavior of the links using the theory of hedonic game,called spectrum allocation game.The game is proved to converge to the core stable state indicating that all links satisfy with their current conditions and do not deviate from their coalitions.Numerical results show that the game improves spectral efficiency and contributes to reducing the individual cost of the links.
文摘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.
