A common problem in RoboCup is role allocation: given a team of players and a set of roles, how should be roles be allocated to players? Drawing on our previous work in multi-robot task allocation, we formalize the problem of role allocation as an iterated form of optimal assignment, which is a well-studied problem from operations research. From this perspective, we analyze the allocation mecha...

Recently, a number of methods have been proposed for semi-supervised clustering that employ supervision in the form of pairwise constraints. We describe a probabilistic model for semisupervised clustering based on Hidden Markov Random Fields (HMRFs) that incorporates relational supervision. The model leads to an EMstyle clustering algorithm, the E-step of which requires collective assignment of...

Many heuristic algorithms have been proposed for graph coloring. The simplest is perhaps the greedy algorithm. Many variations have been proposed for this algorithm at various levels of sophistication, but it is generally assumed that the coloring will occur in a single attempt. We note that if a new permutation of the vertices is chosen which respects the independent sets of a previous colorin...

The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP). There are currently three general classes of such heuristics: classical tour construction heuristics such as Nearest Neighbor and the Greedy algorithm, local search algorithms based on re-arranging segments of the ...

We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and is guaranteed to converge. It is similar to the iterated conditional modes (ICM) algorithm, but applied at each step to a block of variables representing correspondences between two adjacent frames, with the optimal con...

This paper focuses on the precast supply chain scheduling problem with time-dependent transportation time to minimise total weighted tardiness (PSCSP_TDT |TWT). In problem, an order sequence and several job sequences are be determined simultaneously. At first, through in-depth analysis of structure real data from a manufacturer, we approximate into three-stage by combining seven production stag...

• Extrusion-based production scheduling is investigated. Iterated Greedy extended for optimizing Additive Manufacturing Scheduling Problems, AMSP. The developed algorithm outperforms the state-of-the-art in AMSP literature. Directions future development of AMSPs are suggested. As a disruptive technology, additive manufacturing (AM) revolutionizing supply chains. AM consists producing 3-dimensio...

The goal of this paper is to study the performance Thresholding Greedy Algorithm (TGA) when we increase size greedy sums by a constant factor λ⩾1. We introduce so-called λ-almost and λ-partially bases. case λ=1 gives us classical definitions almost (strong) partially show that basis if only it for all (some) However, each λ>1, there exists an unconditional but not 1-partially greedy. Furthermor...