Location:
Search - Webots
Search list
Description: webots
Platform: |
Size: 30720 |
Author: ketilar |
Hits:
Description: 基于视觉的移动机器人。webots平台。应用camera判定距离-Vision-based mobile robot. webots platform
Platform: |
Size: 11264 |
Author: 陈伟 |
Hits:
Description: RoboCup足球机器人3V3 控制程序，包括动作，行为，合作。可以在Webots 机器人模拟器进行上测试和演示。-RoboCup Robot Controlers
Platform: |
Size: 62464 |
Author: Ricky |
Hits:
Description: darwin_op humanoid robot word simulation Webots.controller
Platform: |
Size: 1024 |
Author: gamchan |
Hits:
Description:
a simulation of a swarm algorithm in Webots environment
Platform: |
Size: 186368 |
Author: mahnaz mahmoodian |
Hits:
Description: webots平台的摄像头camera的代码实现。-the plateForm of webots camera
Platform: |
Size: 7168 |
Author: helloworld |
Hits:
Description: webots serial port write or read
Platform: |
Size: 1265664 |
Author: hery |
Hits:
Description: Q-learning for mobile robot on enviroment with e_greedy_selection system
thes code is ok for webots (e-puck- robot) software-Q-learning for mobile robot on enviroment with e_greedy_selection system
thes code is ok for webots (e-puck- robot) software
Platform: |
Size: 4096 |
Author: marzbal |
Hits:
Description: webots 强化学习 避障算法 惩罚 随机
-webots punishment reinforcement learning obstacle avoidance algorithm randomly
Platform: |
Size: 3072 |
Author: 乌鸦 |
Hits:
Description: 四轮全向移动机器人在webots下的仿真 -Four-wheel omni-directional mobile robot simulation in webots
Platform: |
Size: 1024 |
Author: shi jianbo |
Hits:
Description: Webots学习实例，完成机器人避障功能，用户可在其基础上进行修改，例如：改进控制器。(Webots learning examples, complete the robot obstacle avoidance function, users can be based on the modification, for example: improve the controller.)
Platform: |
Size: 32768 |
Author: laurent_nov
|
Hits:
Description: 在?Webots?模拟平台中，使用?E‐puck?模拟机器人及相应?SDK?，根据每个路口的拥塞情况，进行路线规划，使得机器人可以最快到达 目的地。(The input is divided into the congestion level of the intersection and the length of the road. The map consists of 49 lattice, we follow from left to right, from the bottom to the top of the order for each grid point number 1 to 49, when the input congestion degree of each grid point and then input the input side of the time, according to u, V, W, u, V as input, the number of grid points, w to connect the two lattice path length. The rule of planning path is the minimum of a* path length +b* congestion. (a, B can take 1) Students who are interested in achieving dynamic changes need to set up a function that generates random numbers. Once every intersection is called, the function will randomly generate the degree of congestion at each intersection.)
Platform: |
Size: 14336 |
Author: 剑姬2
|
Hits: