NASA estimates 4,700 'potentially hazardous' asteroids
This image, taken by NASA's Near Earth Asteroid Rendezvous mission in 2000, shows a close-up view of the asteroid Eros.
May 16th, 2012
08:19 PM ET

NASA estimates 4,700 'potentially hazardous' asteroids

About 4,700 asteroids are close enough and big enough to pose a risk to Earth, NASA estimated Wednesday after studying data beamed back from an orbiting telescope.

The figure - give or take 1,500 - is how many space rocks bigger than 100 meters (330 feet) across are believed to come within 5 million miles (8 million km) of Earth, or about 20 times farther away than the moon.

"It's not something that people should panic about," said Amy Mainzer, an astronomer at NASA's Jet Propulsion Laboratory in California. "However, we are paying attention to the issue."

NASA defines a potentially hazardous asteroid as one large enough to survive the intense heat generated by entry into the atmosphere and cause damage on a regional scale or worse. The figure released Wednesday is lower than a previous rough estimate had projected, but more are now thought to be in orbits inclined like Earth's, making them more likely to cross its path.


Post by:
Filed under: Hardware in Orbit • In Space • News
Waiting for a bus? Math may help
Cebrina Benson’s Georgia Tech bus is equipped with GPS and a computer pad that allow her to drive without a schedule.
May 16th, 2012
08:00 AM ET

Waiting for a bus? Math may help

Georgia Tech student Alexandra Gaigelas takes a shuttle bus to get around the Atlanta campus. Many times, she waits too long for a bus.

"There's nothing more frustrating than standing at a stop, waiting for 10 minutes, getting on the bus and seeing another bus directly behind you.”

And that second bus is largely empty. It's called bus bunching, and it happens when buses are thrown off schedule because of traffic, weather or too many passengers at one stop.

And when those buses are off schedule, the drivers try to adjust. Student Sukirat Bakshi says he's been victim of a bus "drive-by."

“It happened to me where the driver just would not stop at a stop. They would just run off to catch up to the schedule.”

It turns out math can fix the problem. Georgia Tech professor John Bartholdi and University of Chicago professor Donald Eisenstein used complex algebra to develop a kind of anti-bus-bunching formula. They took what’s known as the Markov Chain through the wringer. It’s a math theory that shows predictable long-term behavior.

“The trick is to hold the bus for an adjustable amount of time at one stop,” Bartholdi said. “We simply control how long they wait at the end of the route, and then we tell them, 'drive comfortable with the traffic to the other end. Don’t worry about where you are. Just flow with the traffic.' "

Buses in the loop are all connected through GPS and a computer pad. It signals to the driver when it’s time to leave. Georgia Tech is testing the theory on its shuttle system.

“This tells me exactly when it’s time to go, and the communication between each other is done automatically, so it takes a lot of stress from us,” said Clarence July, who drives one of the gold and yellow Georgia Tech buses.

Drivers can ignore the schedule, and riders on campus can walk up to any stop and know that a bus will come within approximately six minutes. Bartholdi and Eisenstein say their math formula works for any shuttle system that runs in a loop in which buses are no more than about 12 to 15 minutes apart.

“Others have tried to control buses by asking drivers to try to adhere to a target schedule,” Bartholdi said. “What is new here is that the buses in effect coordinate themselves. No one needs to tell the drivers what to do; no one needs to worry about being off-schedule or how to recover a lost schedule.”

Georgia Tech plans to fully implement the no schedule bus system on campus this fall.

Here's how Bartholdi explains the equations used to calculate the space between buses:

This equation is actually a bunch of equations: one for each bus. The first line describes how the headway (the space between buses) changes for the bus that is currently at the end of the route (the turnaround point). Alpha (in red) is a control parameter - a number, say, 0.5 - by which the bus manager chooses whether the bus should wait longer (and fix imbalances faster) or vice versa. The "v" is the average velocity of the buses.

The second line describes how the headways of the other buses change.

This collection of equations describes how the headways change from bus arrival t to the next bus arrival t+1. In other words, it predicts the future behavior of all the buses.

Don Eisenstein and I recognized that this set of equations has a very special algebraic structure: they describe a "Markov Chain," which is a sequence of events for which the future can be predicted by knowing merely the current state (no history is needed). In our case, we only need to know the most recent headways to predict the next headways, and the headways after those, and so on.

The theory of Markov Chains allows us to conclude that, in the absence of disruptions, the headways will move inexorably and quickly toward a common value, which is given in the equation above. What this means in practice is that the buses will move away from each other, to space themselves more evenly. In other words, we will have created a force, a sort of "anti-gravity” that pushes the buses apart and so resists bunching.

Post by:
Filed under: News


  • Elizabeth Landau
  • Sophia Dengo
    Senior Designer