Can you park your car like this?

One of the problems with cars is that they take space. A lot of space, mainly when they are not being used. A research project is developing robots that could make the task of parking cars a totally different experience.

The authors claim that “a swarm of robots is able to extract vehicles from confined spaces with delicate handling, swiftly and in any direction. The novel lifting robots are capable of omnidirectional movement, thus they can under-ride the desired vehicle and dock to its wheels for a synchronized lifting and extraction. The overall developed system applies reasoning about available trajectory paths, wheel identification, local and undercarriage obstacle detection, in order to fully automate the process.”

This is one amazing idea, and while right now they are probably targeting the security forces that need to deal with badly parked cars and potential threats to security, I imagine that these would be great in managing parking silos. One could just drop the car at the entrance and a group of robots would take the car and park the car in the silo as to optimise the space available. No more having to put with those drivers that need the space of three cars to park a CORSA.

Well, in any case the European team of AVERT is going to present this work on a conference, but I see a lot of potential in their idea to make this into a commercial success. The preprint of the paper is available for download.

In a not so far away future robots will replace valets and optimise parking space in silos. Great!

Playing with A* Updated

A* algorithm

Just updated the Playing with A* algorithm app so that now one can toggle on and off the use of the heuristic and the use of a cross product tiebreaker. This leads to new variants of the algorithm, mainly the well known Dijkstra algorithm.

This A * application was written in Java, so you’ll need to check your java permissions to run it. You can download the .jnlp file and run it from your computer.

The A* Algorithm (A star) is a pathfinding and graph traversal algorithm. It is widely used in computer science, games, robotics and network science. A thorough overview of the algorithm can be found in Introduction to A* which presents several comparisons and illustrations on the mechanics of the A star algorithm.

Playing with the A* Algorithm

A star algorithm

In computer science, A* (pronounced “A star”) is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes. Noted for its performance and accuracy, it enjoys widespread use. [Wikipedia]

My implementation uses a tie-breaker based on the cross product of the vectors from the start to the target and the evaluated node and the target.

The A Star App was coded in java. If your browser doesn’t run java you can download the A Star Jnlp file and run it from your desktop.