|
Inaugural Programming Challenge
Inspired by the DARPA Robotics competition.
You have a robot with N degrees of freedom. Compute a discrete path in the robot's state space such that it goes from its original state, A, to a specified goal state, B, while avoiding obstacles.
A sample input for A and B: (A1, A2, A3, ... , An), (B1, B2, B3,...,Bn)
A sample input for obstacles (n=3):
0-5
1-3
2-7
1.2-4
-.2-0
10-11.4
You may use any language you desire. Not only will you be scored on completion of this task, but also efficiency of the program and code organization.
__________________
"You're a gentleman," they used to say to him. "You shouldn't have gone murdering people with a hatchet; that's no occupation for a gentleman."
Last edited by faust1706 : 25-06-2015 at 15:20.
|
Tell the truth - that's really a small barbecue grill on that robot isn't it. - Tom Line [more] 
Threaded Mode