代做Artificial Intelligence Use代做Java程序

Artificial Intelligence Use

Robocode is a Java programming game, where the goal is to develop a robot battle tank to battle against other tanks. The robot battles are running in real-time and on-screen. The motto of Robocode is: Build the best, destroy the rest!
In this assignment, you are required to build some Robocode robots to accomplish different tasks.
You will also need to have a design document on each robot you made.
To make the game more interesting, we are using a modified version of Robocode that can create obstacles in the battlefield before starting a game. In order to adapt to the customized version of Robocode, you need to download the Robocode setup file posted in the Moodle site. You robot must implement the following interfaces also:
robocode.robotinterfaces.IObstacleRobot and robocode.robotinterfaces.IObstacleEvents.
In IObstacleRobot interface, you need to implement the following method:
public IObstacleEvents getObstacleEventListener() { return this; }
The method will return an object that implements IObstacleEvents.
In IObstacleEvents interface, you need to implement the following methods:
public void onHitObstacle(HitObstacleEvent event) { … }
public void onScannedObstacle(ScannedObstacleEvent event) { … }
The two methods will be implemented by the robot accordingly if the two events are to be handled.
The HitObstacleEvent and ScannedObstacleEvent can give you the bearing of the obstacle and the distance between you and the obstacle (for ScannedObstacleEvent only) through the getBearing() and getDistance() methods form. the event object.

TASK 1

Design a Chasing Robot
In this task, you will need to model a robot that chases and attacks TWO ObstacleEvader robots until they die in a map that contains a number of random obstacles of a size of 50×50 pixels. While
your robot is making line-of-sight chasing to the enemy, it may encounter obstacles also. You will need to figure some ways to go around the obstacles and try to chase the same target after passing the obstacles.
Deliverables:
– A brief description how your robot avoids the obstacles and locks the same target while passing the obstacle.
– The robot’s java file.

TASK 2

Design a Robot as a Finite State Machine
In this task, you will need to model a robot using a finite state machine. There will be big blocks of obstacles (with size of 250×150 pixels) placed in the battlefield. There will be 6 other enemies in the battlefield also. Your robot should try to walk along the wall while attacking other robots. Your robot should also avoid being stuck into an obstacle or a corner. If there is only one robot left, your robot should turn into a chasing robot to destroy your last enemy. Your robot should have at least SIX different states. You may divide the states into sub-states if you want to. Here are some state
suggestions:
• Idle (starting state)
• Finding Wall
• Avoiding Obstacle
• Avoiding Corner
• Moving Along Wall
• Chasing
You can add other states to improve your robot. Your robot will use its senses (radar or hit events) (i.e., onScannedRobot(),onBulletHit(), onHitByBullet() and etc.) and its own attributes (e.g.,getBattleFieldWidth(), getBattleFieldWidth(), getX(), getY(), getOthers() and etc.) as the condition of state transition. You may also need to apply guessing and/or calculation to make your robot more robust.
Your current state can be stored as an instance variable. Try using switch case statement in your run() method. Each case represents the action for each state of your robot. The state transition should be triggered by the onXXX() methods and/or inside your run() method when you are checking your robot’s status.

Deliverables:
– A diagram representing the state transition of the robot.
– A brief description of the states and transition.
– The robot’s java file. You should try your best to implement the robot as the state machine designed by yourself. Marks will be deducted if the robot does not implement as designed.






热门主题

课程名

mktg2509 csci 2600 38170 lng302 csse3010 phas3226 77938 arch1162 engn4536/engn6536 acx5903 comp151101 phl245 cse12 comp9312 stat3016/6016 phas0038 comp2140 6qqmb312 xjco3011 rest0005 ematm0051 5qqmn219 lubs5062m eee8155 cege0100 eap033 artd1109 mat246 etc3430 ecmm462 mis102 inft6800 ddes9903 comp6521 comp9517 comp3331/9331 comp4337 comp6008 comp9414 bu.231.790.81 man00150m csb352h math1041 eengm4100 isys1002 08 6057cem mktg3504 mthm036 mtrx1701 mth3241 eeee3086 cmp-7038b cmp-7000a ints4010 econ2151 infs5710 fins5516 fin3309 fins5510 gsoe9340 math2007 math2036 soee5010 mark3088 infs3605 elec9714 comp2271 ma214 comp2211 infs3604 600426 sit254 acct3091 bbt405 msin0116 com107/com113 mark5826 sit120 comp9021 eco2101 eeen40700 cs253 ece3114 ecmm447 chns3000 math377 itd102 comp9444 comp(2041|9044) econ0060 econ7230 mgt001371 ecs-323 cs6250 mgdi60012 mdia2012 comm221001 comm5000 ma1008 engl642 econ241 com333 math367 mis201 nbs-7041x meek16104 econ2003 comm1190 mbas902 comp-1027 dpst1091 comp7315 eppd1033 m06 ee3025 msci231 bb113/bbs1063 fc709 comp3425 comp9417 econ42915 cb9101 math1102e chme0017 fc307 mkt60104 5522usst litr1-uc6201.200 ee1102 cosc2803 math39512 omp9727 int2067/int5051 bsb151 mgt253 fc021 babs2202 mis2002s phya21 18-213 cege0012 mdia1002 math38032 mech5125 07 cisc102 mgx3110 cs240 11175 fin3020s eco3420 ictten622 comp9727 cpt111 de114102d mgm320h5s bafi1019 math21112 efim20036 mn-3503 fins5568 110.807 bcpm000028 info6030 bma0092 bcpm0054 math20212 ce335 cs365 cenv6141 ftec5580 math2010 ec3450 comm1170 ecmt1010 csci-ua.0480-003 econ12-200 ib3960 ectb60h3f cs247—assignment tk3163 ics3u ib3j80 comp20008 comp9334 eppd1063 acct2343 cct109 isys1055/3412 math350-real math2014 eec180 stat141b econ2101 msinm014/msing014/msing014b fit2004 comp643 bu1002 cm2030
联系我们
EMail: 99515681@qq.com
QQ: 99515681
留学生作业帮-留学生的知心伴侣!
工作时间:08:00-21:00
python代写
微信客服:codinghelp
站长地图