Multi-linked negotiation describes a situation where one agent needs to negotiate with multiple agents about different issues, and the negotiation over one issue influences the negotiations over other issues. Multi-linked issues will become important for the next generation of more complicated Multi-Agent Systems. However, most current negotiation research looks only at single issue negotiation...

Many existing natural language generation systems can be characterized according to their modularization as either pipelined or interleaved. In these separated systems, the generator is divided into several modules (e.g., planning and realization), with control and information passing between themodules during the generation process. This paper proposes a third type of generator, which we call ...

The network design problem with relays (NDPR) is defined on an undirected graph G = (V,E,K), where V = {1, . . . ,n} is a vertex set, E = {(i, j) : i, j 2 V, i < j} is an edge set. The set K = {(o(k),d(k))} is a set of communication pairs (or commodities): o(k) 2 V and d(k) 2 V denote the origin and the destination of the kth commodity, respectively. With each edge (i, j) are associated a cost ...

End-to-end models for strategic dialogue are challenging to train, because linguistic and strategic aspects are entangled in latent state vectors. We introduce an approach to generating latent representations of dialogue moves, by inducing sentence representations to maximize the likelihood of subsequent sentences and actions. The effect is to decouple much of the semantics of the utterance fro...

This paper proposes a way of using scenario planning within joint interdisciplinary research programs, i.e. where industry and academia collaborate on a set of projects, to create a common mental platform which improves the understanding and collaboration within the program, gives management support and in addition results in an appealing description of the research idea from different perspect...

Unexpected obstacles pose significant challenges to mobile robot navigation. In this paper we investigate how, based on the assumption that unexpected obstacles really follow patterns that can be exploited, a mobile robot can learn the locations within an environment that are likely to contain obstacles, and so plan optimal paths by avoiding these locations in subsequent navigation tasks. We pr...

This paper describes a slope scaling heuristic for solving the multicomodity capacitated fixed-charge network design problem. The heuristic integrates a Lagrangean perturbation scheme and intensification/diversification mechanisms based on a long-term memory. Although the impact of the Lagrangean perturbation mechanism on the performance of the method is minor, the intensification/diversificati...

We consider the problem of online planning for a mobile robot among obstacles, where it is impractical to test all possible future paths. One approach is for the runtime task to test some subset of the possible paths and select a path that does not collide with obstacles while advancing the robot toward its goal. Performance depends on the choice of path set. In this paper we assume the path se...

This paper compares planning results of the electricity and water generation inventory up to year 2030 in the State of Kuwait. Currently, the generation inventory consists of oil and gas fired technologies only. The planning study considers two main cases. The first case, Reference case, examines a generation inventory based on oil and gas fired generation technologies only. The second case exa...