#### Filter Results:

#### Publication Year

1999

2006

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show… (More)

- Manuela M. Veloso, Tucker R. Balch, Peter Stone, Hiroaki Kitano, Fuminori Yamasaki, Ken Endo +9 others
- AI Magazine
- 2002

in Osaka. RoboCup is a research-oriented initiative that pioneered the field of multirobot research of robot teams starting in 1996. In those days, most of the robotics research was focused on single-robot issues. RoboCup opened a new horizon for multirobot research: Teams of robots need to face other teams of robots to accomplish specific goals. This… (More)

There is a conjecture due to Shaoji 3], about uniquely vertex r-colorable graphs which states: \ If G is a uniquely vertex r-colorable graph with order n and size (r ? 1)n ? ? r 2 , then G contains a K r as its subgraph." In this paper for any natural number r we construct a K r-free, uniquely r-colorable graph with (r ? 1)n ? ? r 2 edges. These families of… (More)

A mobile robot should be able to analyze what it is seeing in real time rate and decide accordingly. Fast and reliable analysis of image data is one of the key points in soccer robot performance. In this paper we suggest a very fast method for object finding which uses the concept of perspective view. In our method, we introduce a set of jump points in… (More)

We study the problem of maintaining a (1+)-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple algorithm that only needs to store O(1 log R) points at any time, where the parameter R denotes the " spread " of the point set. This bound is optimal and improves Feigen-baum, Kannan, and… (More)

A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way, we generalize a theorem which characterizes uniquely 2-list colorable graphs. We introduce the uniquely list chromatic number of a graph and… (More)

In this paper we describe some mechanical, hardware and software aspects of our robots specially used in teamwork. The pneumatic design of the gripers and kicker enables the robot to make a good control of ball when dribbling and also passing the ball in short and long distances. The teamwork software enables our robots to perform a cooperative behavior by… (More)

Arvand is a robot specially designed and constructed for playing soccer according to RoboCup rules and regulations for the medium size robots. This robot consists of moving mechanism, motion control hardware, software and wireless communication system. The motion mechanism is based on a drive unit, a steer unit and a castor wheel. Motion control is carried… (More)

Arvand is the name of robots specially designed and constructed by sharif CE team for playing soccer according to RoboCup rules and regulations for the middle size robots. Two diierent types of robots are made, players and the goal keeper. A player robot consists of three main parts: mechanics (motion mechanism and kicker), hardware (image acquisition,… (More)