Hybrid Algorithms for On-Line Search and Combinatorial Optimization Problems

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Unknown venue

• Publication date

  1997-05-28

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Piecemeal Graph Exploration by a Mobile Robot

  1999cited by this paper
• Mixed Logical-linear Programming

  1999influential reference
• Flexible, Constraint-Based Tools for Complex Scheduling Applications

  1999influential reference
• Map-Based Strategies for Robot Navigation in Unknown Environments

  1998cited by this paper
• On-Line Graph Searching by a Smell-Oriented Vertex Process

  1997cited by this paper
• Sensor-based planning with the freespace assumption

  1997cited by this paper
• Applying constraint satisfaction techniques to job shop scheduling

  1997influential reference
• Agent-Centered Search: Situated Search with Small Look-Ahead

  1996influential reference
• Graph learning with a nearest neighbor approach

  1996cited by this paper
• Weighting for Godot: Learning Heuristics for GSAT

  1996influential reference
• Do Computers Need Common Sense?

  1996cited by this paper
• Handbook of combinatorics (vol. 1)

  1996cited by this paper
• Improving the Learning Efficiencies of Realtime Search

  1996cited by this paper
• Assumptive planning and execution: A simple, working robot architecture

  1996cited by this paper
• Efficient Goal-Directed Exploration

  1996cited by this paper
• Empirical Support for Winnow and Weighted-Majority Based Algorithms: Results on a Calendar Scheduling Domain

  1995cited by this paper
• From Approximate to Optimal Solutions: A Case Study of Number Partitioning

  1995influential reference
• Limited Discrepancy Search

  1995influential reference
• The Focussed D* Algorithm for Real-Time Replanning

  1995cited by this paper
• WebWatcher : A Learning Apprentice for the World Wide Web

  1995cited by this paper
• Fast Planning Through Planning Graph Analysis

  1995influential reference
• A complete navigation system for goal acquisition in unknown environments

  1995cited by this paper
• Unsatisfied Variables in Local Search

  1995influential reference
• Artificial Intelligence: An Empirical Science

  1995cited by this paper
• Logic applied to integer programming and integer programming applied to logic

  1995cited by this paper
• Planning and Learning by Analogical Reasoning

  1994cited by this paper
• Noise Strategies for Improving Local Search

  1994influential reference
• Benchmarks, Testbeds, Controlled Experimentation, and the Design of Agent Architectures Experimentation, and the Design of Agent Architectures

  1993cited by this paper
• Man versus Machine for the World Checkers Championship

  1993cited by this paper
• Experimental Results on the Crossover Point inSatis ability

  1993cited by this paper
• Piecemeal Learning of an Unknown Environment

  1993cited by this paper
• Towards an Understanding of Hill-Climbing Procedures for SAT

  1993influential reference
• An Empirical Study of Greedy Local Search for Satisfiability Testing

  1993cited by this paper
• Optimal and Efficient Path Planning for Unknown and Dynamic Environments

  1993cited by this paper
• Two-dimensional robot navigation among unknown stationary polygonal obstacles

  1993cited by this paper
• Learning continuous-space navigation heuristics in real time

  1993cited by this paper
• An Empirical Analysis of Search in GSAT

  1993cited by this paper
• Incremental path planning on graphs with cycles

  1992cited by this paper
• Complexity Analysis of Real-Time Reinforcement Learning

  1992cited by this paper
• A New Method for Solving Hard Satis ability Problems

  1992influential reference
• Efficient local search for very large-scale satisfiability problems

  1992influential reference
• A mobile robot exploration algorithm

  1992cited by this paper
• Hard and Easy Distributions of SAT Problems

  1992cited by this paper
• PRODIGY4.0: The Manual and Tutorial

  1992cited by this paper
• Efficient Exploration In Reinforcement Learning

  1992cited by this paper
• A 'retraction' method for learned navigation in unknown terrains for a circular robot

  1991cited by this paper
• How to learn an unknown environment

  1991cited by this paper
• Exploring an unknown graph

  1990cited by this paper
• Real-Time Heuristic Search

  1990cited by this paper
• Dynamic path planning in sensor-based terrain acquisition

  1990cited by this paper
• A modular technique for the design of efficient distributed leader finding algorithms

  1990cited by this paper
• Constructing integer programming models by the predicate calculus

  1990cited by this paper
• The complexity of the Pigeonhole Principle

  1988cited by this paper
• Integer and Combinatorial Optimization

  1988cited by this paper
• Generalized resolution and cutting planes

  1988cited by this paper
• Robot navigation in an unexplored terrain

  1986cited by this paper
• Applied Combinatorics

  1984cited by this paper
• Heuristics : intelligent search strategies for computer problem solving

  1984cited by this paper
• A polynomial algorithm in linear programming

  1979influential reference
• Johnson: "computers and intractability

  1979cited by this paper
• An Analysis of Several Heuristics for the Traveling Salesman Problem

  1977influential reference
• STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving

  1971cited by this paper
• Constructions for the Solution of the m Queens Problem

  1969cited by this paper
• Arrays and brooks

  1967cited by this paper
• A Tough Nut for Proof Procedures

  1964influential reference
• Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren

  1873cited by this paper

• 3D path planning, routing algorithms and routing protocols for unmanned air vehicles: a review

  2019cites this paper
• Survey of Robot 3D Path Planning Algorithms

  2016cites this paper
• Worst-case robot navigation in deterministic environments

  2009cites this paper
• Be the Master of Your Success : How to Select Proper HeuristicGuidance for Search , Planning and Scheduling

  2007cites this paper
• Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic

  2005cites this paper
• Analysis of Greedy Robot-Navigation Methods

  2004cites this paper
• Improved analysis of D*

  2003influential citation
• Changes of Problem Representation: Theory and Experiments

  2002cites this paper