CTS Events
November 14, 2012

Dr. Nebiyou Tilahun, UPP, presents a seminar entitled "An agent based model of origin destination estimation (ADOBE)" Wednesday, November 14th at 4:00 pm in Rm 1127 SEO


November 7, 2012

Mr. Thomas Murtha, CMAP, will address the CTS-IGERT community at 4:00 p.m. in Room 1127 SEO.


October 24, 2012

Please join us in welcoming Dr. Bo Zou, CME, on Wednesday, October 24th, Room 1127 SEO, 4:00 p.m.


CTS Happenings
September 25, 2012

Award Received by Joshua Auld, CTS-IGERT alumnus.


April 20, 2012

Congratulations to James Biagioni, CTS Fellow and CS PhD candidate, winner of the Dean's Scholar award.


January 2, 2012

James Biagioni, CTS Fellow, receives "Best Presentation Award" at SenSys2011


July 30, 2010

Dr. Ouri Wolfson, Dr. Phillip Yu, and Leon Stenneth, CS student and CTS Associate, recently had a paper accepted to the 6th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2010).


October 18, 2007

Dr. Horst F. Wedde, "A Novel Class of Multi-Agent Algorithms for Avoiding Traffic Congestions Inspired by Honey Bee Behavior"

Download: A Novel Class of Multi-Agent Algorithms for Highly Dynamic Transport Planning Inspired by Honey Bee Behavior

Horst F. Wedde, Professor, School of Computer Science at the University of Dortmund in Germany, will present a seminar.

Time: 11:00 am
Location: 1000 SEO

Commercial transport planning as well as individual intra-city or inter-city traffic in densely populated regions, both in Europe and the US, increasingly suffer from congestion problems, to an extent which e.g. affects predictable transport planning substantially (except - so far - for overnight tours). Due to the highly dynamic character of congestion forming and dissolving, no static approach like shortest path finding, whether applied globally or individually in car navigators, is adequate here: Its use even makes things worse as can be frequently observed. In this paper we present a completely decentralized multi-agent approach (termed BeeJamA) on multiple layers where car or truck routing are handled through algorithms adapted from the BeeHive algorithms which in turn have been derived from honey bee behavior. We report on extensive distributed simulation experiments in the BeeJamA project which demonstrate a very substantial improvement over traditional congestion handling.

A related paper on this topic may be downloaded here: "A Novel Class of Multi-Agent Algorithms for Highly Dynamic Transport Planning Inspired by Honey Bee Behavior"