RI | People | Laura Barbulescu

Text only version of this site

Laura Barbulescu
Project Scientist

Email address: laurabar@andrew.cmu.edu

Mailing address:
Carnegie Mellon University
Robotics Institute
5000 Forbes Avenue
Pittsburgh, PA 15213

Jump to: Research interests | Labs & groups | Projects | Publications

Research interests

My research interests are in the area of artificial intelligence, with an emphasis on scheduling and heuristic search. Recently I have focused on distributed scheduling for a team of collaborative agents in a dynamic environment, where the goal is to maximize the quality of the actions executed by all the agents. I have also performed research and published papers in combinatorial optimization, genetic algorithms and the empirical evaluation and analysis of algorithms.

Current Labs & Groups

Intelligent Coordination and Logistics Laboratory - developing new theories, techniques and software technologies in planning, scheduling and control

Current Projects

AMC Barrelmaster Scheduling - Integrated management of airlift and tanker missions at the USAF Air Mobility Command.

Coordinators - The DARPA COORDINATORS program defines a challenging multi-agent application, with agents operating in a highly dynamic environment, where no agent has a complete view of the problem.

Publications

Note: This list may not be comprehensive. It contains only those publications in the RI publications database. Entries are listed in reverse chronological order.

• Searching Alternate Spaces to Solve Oversubscribed Scheduling Problems
  L. Kramer, L. Barbulescu, and S. Smith
  tech. report CMU-RI-TR-08-12, Robotics Institute, Carnegie Mellon University, March, 2008. [Abstract]
  Download: pdf [278 KB] copyrighted

• Benchmark Problems for Oversubscribed Scheduling
  L. Barbulescu, L. Kramer, and S. Smith
  Workshop on Scheduling a Scheduling Competition, The 17th International Conference on Automated Planning & Scheduling (ICAPS-07), September, 2007. [Abstract]
  Download: pdf [90 KB] copyrighted

• Analyzing Basic Representation Choices in Oversubscribed Scheduling Problems
  L. Kramer, L. Barbulescu, and S. Smith
  Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Application (MISTA-07), August, 2007. [Abstract]
  Download: pdf [157 KB] copyrighted

• Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling
  L. Kramer, L. Barbulescu, and S. Smith
  Proceedings 22nd Conference on Artificial Intelligence (AAAI-07), July, 2007. [Abstract]
  Download: pdf [171 KB] copyrighted

• Distributed Management of Flexible Times Schedules
  S. Smith, A.T. Gallagher, T.L. Zimmerman, L. Barbulescu, and Z. Rubinstein
  2007 Intl conf on Autonomous Agents and Multiagent Systems (AAMAS), May, 2007. [Abstract]
  Download: pdf [363 KB] copyrighted

• Multi-Agent Management of Joint Schedules
  S. Smith, A.T. Gallagher, T.L. Zimmerman, L. Barbulescu, and Z. Rubinstein
  Proceedings of the 2006 AAAI Spring Symposium on Distributed Plan and Schedule Management, AAAI Press, March, 2006. [Abstract]
  Download: pdf [309 KB] copyrighted