Goto

Collaborating Authors

 constraint and preference


An Extensible and Personalizable Multi-Modal Trip Planner

arXiv.org Artificial Intelligence

Despite a tremendous amount of work in the literature and in the commercial sectors, current approaches to multi-modal trip planning still fail to consistently generate plans that users deem optimal in practice. We believe that this is due to the fact that current planners fail to capture the true preferences of users, e.g., their preferences depend on aspects that are not modeled. An example of this could be a preference not to walk through an unsafe area at night. We present a novel multi-modal trip planner that allows users to upload auxiliary geographic data (e.g., crime rates) and to specify temporal constraints and preferences over these data in combination with typical metrics such as time and cost. Concretely, our planner supports the modes walking, biking, driving, public transit, and taxi, uses linear temporal logic to capture temporal constraints, and preferential cost functions to represent preferences. We show by examples that this allows the expression of very interesting preferences and constraints that, naturally, lead to quite diverse optimal plans.


An Extensible and Personalizable Multi-Modal Trip Planner

AAAI Conferences

Despite a tremendous amount of work in the literature and in the commercial sectors, current approaches to multi-modal trip planning still fail to consistently generate plans that users deem optimal in practice. We believe that this is due to the fact that current planners fail to capture the true preferences of users, e.g., their preferences depend on aspects that are not modeled. An example of this could be a preference not to walk through an unsafe area at night. We present a novel multi-modal trip planner that allows users to up- load auxiliary geographic data (e.g., crime rates) and to specify temporal constraints and preferences over these data in combination with typical metrics such as time and cost. Concretely, our planner supports the modes walking, biking, driving, public transit, and taxi, uses linear temporal logic to capture temporal constraints, and preferential cost functions to represent preferences. We show by examples that this allows the expression of very interesting preferences and constraints that, naturally, lead to quite diverse optimal plans.


Towards Grammars for Cradle-to-Cradle Design

AAAI Conferences

Figure 1a first illustrates by the oval that a Cradle-to-cradle (C2C) design (McDonough & Braungart, critical problem in traditional design is that a product is designed 2002) recognizes that nothing short of full recycling of materials in isolation. In contrast, the products shown in the with no degradation in material quality is necessary square box of Figure 1b illustrate the concept of a product for long-term planet sustainability. C2C advocates looking family, where multiple products are designed within a system to the natural world as an ideal model of recycling, where of material use and reuse, which flows between product organic materials are continually recycled through processes lines. While there may still be materials that come from of decay and growth. They propose design methodology outside the family and there are materials that are byproducts that separates biological cycles and syntheticmaterial of the family production, a family design would seek cycles, enabling biological material to be reclaimed to minimize these and to exploit them in a still larger context.


Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions

AI Magazine

Sourcing professionals buy several trillion dollars worth of goods and services yearly. We introduced a new paradigm called expressive commerceand applied it to sourcing. It combines the advantages of highly expressive human negotiation with the advantages of electronic reverse auctions. The idea is that supply and demand are expressed in drastically greater detail than in traditional electronic auctions and are algorithmically cleared. This creates a Pareto efficiency improvement in the allocation (a win-win between the buyer and the sellers), but the market-clearing problem is a highly complex combinatorial optimization problem. We developed the world's fastest tree search algorithms for solving it. We have hosted $35 billion of sourcing using the technology and created $4.4 billion of hard-dollar savings plus numerous harder-to-quantify benefits. The suppliers also benefited by being able to express production efficiencies and creativity, and through exposure problem removal. Supply networks were redesigned, with quantitative understanding of the trade-offs, and implemented in weeks instead of months.