typodupeerror

## The Physical Travelling Salesman Challenge59

mikejuk writes "You probably know that the traveling salesman problem is one of the classics of computer science theory. Now we have a new challenge — the Physical Travelling Salesman Problem and anyone can join in. All you have to do is visit each city once using an optimal route. The new element is that you now have to drive between the cities using a 'car' that has inertia and friction — see the video. You can submit an AI bot to solve the problem or drive the course yourself."
This discussion has been archived. No new comments can be posted.

## The Physical Travelling Salesman Challenge

• #### sounds familiar (Score:5, Informative)

on Saturday April 21, 2012 @10:31AM (#39755739)

Sounds like a relative of the ICFP 2008 contest: http://www.cs.uchicago.edu/newsletter/353 [uchicago.edu]

• #### Re:This is pointless... (Score:5, Informative)

on Saturday April 21, 2012 @10:47AM (#39755833)

The traveling salesman problem is based on a table of distances between the city pairs. It doesn't matter to the problem HOW those distances are calculated, or even if they include other variables. So this can be trivially reduced to the classic version of the problem.

It's not quite as simple. The distance between two destinations is not fixed. The time to get from A to B depends on the speed and direction when you arrived at A or passed through A, and the speed and direction that you want to have when arriving at B.

• #### PTSP Motivation (Score:5, Informative)

on Saturday April 21, 2012 @10:55AM (#39755893)
Hi, I'm the organiser of the competition. The PTSP is meant to be a benchmark where different AI techniques can be tried and tested. This game gathers many of the features that real-time video games have (pathfinding, navigation, obstacle avoidance...). The objective is to provide a benchmark where new AI techniques can be tested and potentially exported to real time games. Of course the objective is not to solve the TSP. Actually, it's been seen that optimal TSP solutions, if we just consider the distances between the waypoints, do not create optimal PTSP paths. This makes the problem harder than just applying one of the very well known techniques to solve the TSP. Currently we have a couple of submissions that are behaving quite well, but there could be still room for improvement! Cheers, Diego.
• #### Re:Uh, okay? (Score:5, Informative)

on Saturday April 21, 2012 @10:58AM (#39755917)

It's simply meant to be an implementation of a heuristic, based on the traveling salesman problem, that takes into account physical considerations (speed, acceleration, direction) and processing limitations (RAM, processor cycles) for both initial setup and decision-making at each step.

The speed/direction stuff reminds me of the kind of skating that hockey players do (is it more effective to go in one direction, stop, and turn around, or is it better to modify your line and preserve momentum? in this game, too, is it better to accelerate greatly and bounce off a wall behind your target, or approach more slowly in order to modify your line without an abrupt change in direction?).

The processing limitations are interesting too, and provide for an interesting optimization exercise.

Or, by "I don't understand", should I simply answer "it's fun"...? ;)

#### Related LinksTop of the: day, week, month.

You can measure a programmer's perspective by noting his attitude on the continuing viability of FORTRAN. -- Alan Perlis

Working...