Arrow Research search

Author name cluster

Kurt Konolige

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

49 papers
2 author rows

Possible papers

49

ICRA Conference 2018 Conference Paper

Using Simulation and Domain Adaptation to Improve Efficiency of Deep Robotic Grasping

  • Konstantinos Bousmalis
  • Alex Irpan
  • Paul Wohlhart
  • Yunfei Bai
  • Matthew Kelcey
  • Mrinal Kalakrishnan
  • Laura Downs
  • Julian Ibarz

Instrumenting and collecting annotated visual grasping datasets to train modern machine learning algorithms can be extremely time-consuming and expensive. An appealing alternative is to use off-the-shelf simulators to render synthetic data for which ground-truth annotations are generated automatically. Unfortunately, models trained purely on simulated data often fail to generalize to the real world. We study how randomized simulated environments and domain adaptation methods can be extended to train a grasping system to grasp novel objects from raw monocular RGB images. We extensively evaluate our approaches with a total of more than 25, 000 physical test grasps, studying a range of simulation conditions and domain adaptation methods, including a novel extension of pixel-level domain adaptation that we term the GraspGAN. We show that, by using synthetic data and domain adaptation, we are able to reduce the number of real-world samples needed to achieve a given level of performance by up to 50 times, using only randomly generated simulated objects. We also show that by using only unlabeled real-world data and our GraspGAN methodology, we obtain real-world grasping performance without any real-world labels that is similar to that achieved with 939, 777 labeled real-world samples.

ICRA Conference 2012 Conference Paper

Exploiting segmentation for robust 3D object matching

  • Michael Krainin
  • Kurt Konolige
  • Dieter Fox

While Iterative Closest Point (ICP) algorithms have been successful at aligning 3D point clouds, they do not take into account constraints arising from sensor viewpoints. More recent beam-based models take into account sensor noise and viewpoint, but problems still remain. In particular, good optimization strategies are still lacking for the beam-based model. In situations of occlusion and clutter, both beam-based and ICP approaches can fail to find good solutions. In this paper, we present both an optimization method for beambased models and a novel framework for modeling observation dependencies in beam-based models using over-segmentations. This technique enables reasoning about object extents and works well in heavy clutter. We also make available a ground-truth 3D dataset for testing algorithms in this area.

ICRA Conference 2011 Conference Paper

G 2 o: A general framework for graph optimization

  • Rainer Kümmerle
  • Giorgio Grisetti
  • Hauke Strasdat
  • Kurt Konolige
  • Wolfram Burgard

Many popular problems in robotics and computer vision including various types of simultaneous localization and mapping (SLAM) or bundle adjustment (BA) can be phrased as least squares optimization of an error function that can be represented by a graph. This paper describes the general structure of such problems and presents g 2 o, an open-source C++ framework for optimizing graph-based nonlinear error functions. Our system has been designed to be easily extensible to a wide range of problems and a new problem typically can be specified in a few lines of code. The current implementation provides solutions to several variants of SLAM and BA. We provide evaluations on a wide range of real-world and simulated datasets. The results demonstrate that while being general g 2 o offers a performance comparable to implementations of state of-the-art approaches for the specific problems.

IROS Conference 2011 Conference Paper

Hierarchies of octrees for efficient 3D mapping

  • Kai M. Wurm
  • Daniel Hennes
  • Dirk Holz
  • Radu Bogdan Rusu
  • Cyrill Stachniss
  • Kurt Konolige
  • Wolfram Burgard

The on-chip fabrication and manipulation of microstructures are expected to be applied for single cell analysis system such as cell manipulation and measurement tools. In this paper, we previously present a methodology for fabricating and assembling microstructures inside a microfluidic channel. By the illumination of patterned UV-ray through the mask under a microscope, microstructures with arbitrary shape are made of the photo-crosslinkable resin inside microfluidic device. The microstructures are fabricated at the desired place inside microfluidic channel and manipulated by optical tweezers. Based on the technique which can manipulate multiple points simultaneously by high-speed scanning of a single laser with galvanometer mirror, a rotational microstructure made of a microgear and a rotation axis is assembled and rotated. We also report two methods of solution replacement inside microfluidic channel which reduces viscosity of solvent in order to improve manipulation performance. By adjusting the concentration of photo-crosslinkable resin and replacing solution components, the viscosity of solvent inside channel can be changed. The manipulation speed of the rotational microstructure increases when the viscosity of solvent decreases, because the viscosity resistance for the movement of microstructure is weaker inside lower viscosity solvent. We fabricate rotational microstructures inside lower viscosity solvent and evaluate the movement efficiency compared with microstructures inside former high viscosity solvent.

ICRA Conference 2011 Conference Paper

Navigation in hybrid metric-topological maps

  • Kurt Konolige
  • Eitan Marder-Eppstein
  • Bhaskara Marthi

We present an approach for navigation in hybrid maps consisting of a topological graph overlaid with local occupancy grids. The topological graph is built on top of a graph SLAM system, which can be efficiently optimized even for very large environments. The novel feature of our system is that it navigates locally using local metric maps, while the overall plan is formed on the topological graph. Unlike many current SLAM methods, we never reconstruct a full occupancy grid of the environment for localization or path planning. We show that our method generates near-optimal plans, and deals gracefully with changes to the map.

ICRA Conference 2011 Conference Paper

Point feature extraction on 3D range scans taking into account object boundaries

  • Bastian Steder
  • Radu Bogdan Rusu
  • Kurt Konolige
  • Wolfram Burgard

In this paper we address the topic of feature extraction in 3D point cloud data for object recognition and pose identification. We present a novel interest keypoint extraction method that operates on range images generated from arbitrary 3D point clouds, which explicitly considers the borders of the objects identified by transitions from foreground to background. We furthermore present a feature descriptor that takes the same information into account. We have implemented our approach and present rigorous experiments in which we analyze the individual components with respect to their repeatability and matching capabilities and evaluate the usefulness for point feature based object detection methods.

ICRA Conference 2010 Conference Paper

Autonomous door opening and plugging in with a personal robot

  • Wim Meeussen
  • Melonee Wise
  • Stuart Glaser
  • Sachin Chitta
  • Conor McGann
  • Patrick Mihelich
  • Eitan Marder-Eppstein
  • Marius Muja

We describe an autonomous robotic system capable of navigating through an office environment, opening doors along the way, and plugging itself into electrical outlets to recharge as needed. We demonstrate through extensive experimentation that our robot executes these tasks reliably, without requiring any modification to the environment. We present robust detection algorithms for doors, door handles, and electrical plugs and sockets, combining vision and laser sensors. We show how to overcome the unavoidable shortcoming of perception by integrating compliant control into manipulation motions. We present a visual-differencing approach to high-precision plug-insertion that avoids the need for high-precision hand-eye calibration.

IROS Conference 2010 Conference Paper

Efficient Sparse Pose Adjustment for 2D mapping

  • Kurt Konolige
  • Giorgio Grisetti
  • Rainer Kümmerle
  • Wolfram Burgard
  • Benson Limketkai
  • Régis Vincent

Pose graphs have become a popular representation for solving the simultaneous localization and mapping (SLAM) problem. A pose graph is a set of robot poses connected by nonlinear constraints obtained from observations of features common to nearby poses. Optimizing large pose graphs has been a bottleneck for mobile robots, since the computation time of direct nonlinear optimization can grow cubically with the size of the graph. In this paper, we propose an efficient method for constructing and solving the linear subproblem, which is the bottleneck of these direct methods. We compare our method, called Sparse Pose Adjustment (SPA), with competing indirect methods, and show that it outperforms them in terms of convergence speed and accuracy. We demonstrate its effectiveness on a large set of indoor real-world maps, and a very large simulated dataset. Open-source implementations in C++, and the datasets, are publicly available.

ICRA Conference 2010 Conference Paper

Projected texture stereo

  • Kurt Konolige

Passive stereo vision is widely used as a range sensing technology in robots, but suffers from dropouts: areas of low texture where stereo matching fails. By supplementing a stereo system with a strong texture projector, dropouts can be eliminated or reduced. This paper develops a practical stereo projector system, first by finding good patterns to project in the ideal case, then by analyzing the effects of system blur and phase noise on these patterns, and finally by designing a compact projector that is capable of good performance out to 3m in indoor scenes. The system has been implemented and has excellent depth precision and resolution, especially in the range out to 1. 5m.

ICRA Conference 2010 Conference Paper

The Office Marathon: Robust navigation in an indoor office environment

  • Eitan Marder-Eppstein
  • Eric Berger
  • Tully Foote
  • Brian P. Gerkey
  • Kurt Konolige

This paper describes a navigation system that allowed a robot to complete 26. 2 miles of autonomous navigation in a real office environment. We present the methods required to achieve this level of robustness, including an efficient Voxel-based 3D mapping algorithm that explicitly models unknown space. We also provide an open-source implementation of the algorithms used, as well as simulated environments in which our results can be verified.

ICRA Conference 2010 Conference Paper

Vision-based detection for learning articulation models of cabinet doors and drawers in household environments

  • Jürgen Sturm
  • Kurt Konolige
  • Cyrill Stachniss
  • Wolfram Burgard

Service robots deployed in domestic environments generally need the capability to deal with articulated objects such as doors and drawers in order to fulfill certain mobile manipulation tasks. This however, requires, that the robots are able to perceive the articulation models of such objects. In this paper, we present an approach for detecting, tracking, and learning articulation models for cabinet doors and drawers without using artificial markers. Our approach uses a highly efficient and sampling-based approach to rectangle detection in depth images obtained from a self-developed active stereo system. The robot can use the generative models learned for the articulated objects to estimate their articulation type, their current configuration, and to make predictions about possible configurations not observed before. We present experiments carried out on real data obtained from our active stereo system. The results demonstrate that our technique is able to learn accurate articulation models. We furthermore provide a detailed error analysis based on ground truth data obtained in a motion capturing studio.

IJCAI Conference 2009 Conference Paper

  • Jürgen Sturm
  • Vijay Pradeep
  • Cyrill Stachniss
  • Christian Plagemann
  • Kurt Konolige
  • Wolfram Burgard

Robots operating in home environments must be able to interact with articulated objects such as doors or drawers. Ideally, robots are able to autonomously infer articulation models by observation. In this paper, we present an approach to learn kinematic models by inferring the connectivity of rigid parts and the articulation models for the corresponding links. Our method uses a mixture of parameterized and parameter-free (Gaussian process) representations and finds low-dimensional manifolds that provide the best explanation of the given observations. Our approach has been implemented and evaluated using real data obtained in various realistic home environment settings.

IROS Conference 2009 Conference Paper

Towards lifelong visual maps

  • Kurt Konolige
  • James Bowman

The typical SLAM mapping system assumes a static environment and constructs a map that is then used without regard for ongoing changes. Most SLAM systems, such as FastSLAM, also require a single connected run to create a map. In this paper we present a system of visual mapping, using only input from a stereo camera, that continually updates an optimized metric map in large indoor spaces with movable objects: people, furniture, partitions, etc. The system can be stopped and restarted at arbitrary disconnected points, is robust to occlusion and localization failures, and efficiently maintains alternative views of a dynamic environment. It operates completely online at a 30 Hz frame rate.

ICRA Conference 2008 Conference Paper

A low-cost laser distance sensor

  • Kurt Konolige
  • Joseph Augenbraun
  • Nick Donaldson
  • Charles Fiebig
  • Pankaj Shah

Many indoor robotics systems use laser rangeflnders as their primary sensor for mapping, localization, and obstacle avoidance. The cost and power of such systems is a major roadblock to the deployment of low-cost, efficient consumer robot platforms for home use. In this paper, we describe a compact, planar laser distance sensor (LDS) that has capabilities comparable to current laser scanners: 3 cm accuracy out to 6 m, 10 Hz acquisition, and 1 degree resolution over a full 360 degree scan. The build cost of this device, using COTS electronics and custom mechanical tooling, is under $30.

IROS Conference 2008 Conference Paper

Fast color/texture segmentation for outdoor robots

  • Morten Rufus Blas
  • Motilal Agrawal
  • Aravind Sundaresan
  • Kurt Konolige

We present a fast integrated approach for online segmentation of images for outdoor robots. A compact color and texture descriptor has been developed to describe local color and texture variations in an image. This descriptor is then used in a two-stage fast clustering framework using K-means to perform online segmentation of natural images. We present results of applying our descriptor for segmenting a synthetic image and compare it against other state-of-the-art descriptors. We also apply our segmentation algorithm to the task of detecting natural paths in outdoor images. The whole system has been demonstrated to work online alongside localization, 3D obstacle detection, and planning.

ICRA Conference 2007 Conference Paper

Frame-Frame Matching for Realtime Consistent Visual Mapping

  • Kurt Konolige
  • Motilal Agrawal

Many successful indoor mapping techniques employ frame-to-frame matching of laser scans to produce detailed local maps, as well as closing large loops. In this paper, we propose a framework for applying the same techniques to visual imagery, matching visual frames with large numbers of point features. The relationship between frames is kept as a nonlinear measurement, and can be used to solve large loop closures quickly. Both monocular (bearing-only) and binocular vision can be used to generate matches. Other advantages of our system are that no special landmark initialization is required, and large loops can be solved very quickly.

ICRA Conference 2005 Conference Paper

SLAM via Variable Reduction from Constraint Maps

  • Kurt Konolige

The two dominant forms of SLAM are based on Extended Kalman Filtering and Consistent Pose Estimation. We show that these are particular subsets of a more general view of the SLAM problem, in which variables representing all robot poses and features are kept. The general technique of variable reduction is a unifying view of these methods that is mathematically sound, and which enables us to explore other interesting and computationally compelling forms for solving SLAM problems.

AAAI Conference 2004 Conference Paper

Large-Scale Map-Making

  • Kurt Konolige

Current mapping algorithms using Consistent Pose Estimation (CPE) algorithms can successfully map areas of 104 square meters, using thousands of poses. However, the computation to construct the map grows as O(n log n), so larger maps get increasingly difficult to build. We present an abstraction method for postponing the growth in computation. This method solves a much smaller problem in the space of the connection graph of the map.

IROS Conference 2003 Conference Paper

A practical, decision-theoretic approach to multi-robot mapping and exploration

  • Jonathan Ko
  • Benjamin Stewart
  • Dieter Fox
  • Kurt Konolige
  • Benson Limketkai

An important assumption underlying virtually all approaches to multi-robot exploration is prior knowledge about their relative locations. This is due to the fact that robots need to merge their maps so as to coordinate their exploration strategies. The key step in map merging is to estimate the relative locations of the individual robots. This paper presents a novel approach to multi-robot map merging under global uncertainty about the robot's relative locations. Our approach uses an adapted version of particle filters to estimate the position of one robot in the other robot's partial map. The risk of false-positive map matches is avoided by verifying match hypotheses using a rendezvous approach. We show how to seamlessly integrate this approach into a decision-theoretic multi-robot coordination strategy. The experiments show that our sample-based technique can reliably find good hypotheses for map matches. Furthermore, we present results obtained with two robots successfully merging their maps using the decision-theoretic rendezvous strategy.

IROS Conference 2003 Conference Paper

Map merging for distributed robot navigation

  • Kurt Konolige
  • Dieter Fox
  • Benson Limketkai
  • Jonathan Ko
  • Benjamin Stewart

A set of robots mapping an area can potentially combine their information to produce a distributed map more efficiently than a single robot alone. We describe a general framework for distributed map building in the presence of uncertain communication. Within this framework, we then present a technical solution to the key decision problem of determining relative location within partial maps.

IROS Conference 2000 Conference Paper

A gradient method for realtime robot control

  • Kurt Konolige

Despite many decades of research into mobile robot control, reliable, high-speed motion in complicated, uncertain environments remains an unachieved goal. In this paper we present a solution to realtime motion control that can competently maneuver a robot at optimal speed even as it explores a new region or encounters new obstacles. The method uses a navigation function to generate a gradient field that represents the optimal (lowest-cost) path to the goal at every point in the workspace. Additionally, we present an integrated sensor fusion system that allows incremental construction of an unknown or uncertain environment. Under modest assumptions, the robot is guaranteed to get to the goal in an arbitrary static unexplored environment, as long as such a path exists. We present preliminary experiments to show that the gradient method is better than expert human controllers in both known and unknown environments.

ICRA Conference 2000 Conference Paper

Approximating a Single Viewpoint in Panoramic Imaging Devices

  • Steven Derrien
  • Kurt Konolige

Panoramic cameras, which image a very large field of view, are useful devices for mobile robots that must move rapidly and securely in their environments. Recent panoramic cameras present a very wide field of view from a single viewpoint. A single viewpoint is useful in mobile robotics for a number of reasons, including perspective reprojection and stereo analysis. However, the requirement of single viewpoint for panoramic cameras restricts the optical and geometrical design of these devices. In this paper we present a method for approximating a single viewpoint in panoramic devices that allows much greater freedom in design. We illustrate the method with a compact catadioptric device using a spherical mirror and standard optics, and apply it to perspective reprojection. The resultant panoramic camera has been integrated as a surveillance device on a small mobile robot.

ICRA Conference 2000 Conference Paper

Robot-Mounted Through-Wall Radar for Detecting, Locating, and Identifying Building Occupants

  • David G. Falconer
  • Robert W. Ficklin
  • Kurt Konolige

We have assembled programmed, and demonstrated a robot-mounted motion-detection radar suitable for through-wall operation. Our radar, which employs of pulse-Doppler techniques, is designed to look through building walls and locate moving targets. The radar's signal-processing algorithms use both time-domain and frequency-domain clues to classify detected motion as arising from: (1) the ambient background; (2) mechanical motion; or (3) human activity. In the case of human motion, our routines also attempt to identify the occupant's particular activity, e. g. , resting, walking, talking.

IJCAI Conference 1999 Conference Paper

Markov Localization using Correlation

  • Kurt Konolige
  • Ken Chou

Localization is one of the most important capabilities for autonomous mobile agents. Markov Localization (ML), applied to dense range images, has proven to be an effective technique. But its computational and storage requirements put a large burden on robot systems, and make it difficult to update the map dynamically. In this paper we introduce a new technique, based on correlation of a sensor scan with the map, that is several orders of magnitude more efficient than ML. CBML (correlation-based ML) permits video-rate localization using dense range scans, dynamic map updates, and a more precise error model than ML. In this paper we present the basic method of CBML, and validate its efficiency and correctness in a series of experiments on an implemented mobile robot base.

IROS Conference 1998 Conference Paper

A contour method for real-time range image parsing

  • Nicolas Chauvin
  • Gaëtan Marti
  • Kurt Konolige

Real-time or near real-time range images are available from a variety of sources. Many proposed uses for these devices require significant post-processing to extract relevant 3-D information. We propose a new method based on a generalization of contour maps that has several advantages over current methods in tasks such as terrain reconstruction and obstacle avoidance. The method is illustrated with examples from obstacle avoidance on a mobile robot.

IROS Conference 1998 Conference Paper

An experimental comparison of localization methods

  • Jens-Steffen Gutmann
  • Wolfram Burgard
  • Dieter Fox
  • Kurt Konolige

Localization is the process of updating the pose of a robot in an environment, based on sensor readings. In this experimental study, we compare two methods for localization of indoor mobile robots: Markov localization, which uses a probability distribution across a grid of robot poses; and scan matching, which uses Kalman filtering techniques based on matching sensor scans. Both these techniques are dense matching methods, that is, they match dense sets of environment features to an a priori map. To arrive at results for a range of situations, we utilize several different types of environments, and add noise to both the dead-reckoning and the sensors. Analysis shows that, roughly, the scan-matching techniques are more efficient and accurate, but Markov localization is better able to cope with large amounts of noise. These results suggest hybrid methods that are efficient, accurate and robust to noise.

AIJ Journal 1995 Journal Article

A multivalued logic approach to integrating planning and control

  • Alessandro Saffiotti
  • Kurt Konolige
  • Enrique H. Ruspini

elligent agents embedded in a dynamic, uncertain environment should incorporate capabilities for both planned and reactive behavior. Many current solutions to this dual need focus on one aspect, and treat the other one as secondary. We propose an approach for integrating planning and control based on behavior schemas, which link physical movements to abstract action descriptions. Behavior schemas describe behaviors of an agent, expressed as trajectories of control actions in an environment, and goals can be defined as predicates on these trajectories. Goals and behaviors can be combined to produce conjoint goals and complex controls. The ability of multivalued logics to represent graded preferences allows us to formulate tradeoffs in the combination. Two composition theorems relate complex controls to complex goals, and provide the key to using standard knowledge-based deliberation techniques to generate complex controllers. We report experiments in planning and execution on a mobile robot platform, Flakey.

IJCAI Conference 1993 Conference Paper

A Representationalist Theory of Intention

  • Kurt Konolige
  • Martha E. Pollack

Several formalizations of cognitive state that include intentions and beliefs based on normal modal logics (NMLs) have appeared in the recent literature. We argue that NMLs are not an appropriate representation for intention, and provide an alternative model, one that is representationalist, in the sense that its semantic objects provide a more direct representation of cognitive state of the intending agent. We argue that this approach results in a much simpler model of intention than does the use of an NML, and that, moreover, it allows us to capture interesting properties of intention that have not been addressed in previous work

AIJ Journal 1992 Journal Article

Abduction versus closure in causal theories

  • Kurt Konolige

There are two distinct formalizations for reasoning from observations to explanations, as in diagnostic tasks. The consistency based approach treats the task as a deductive one, in which the explanation is deduced from a background theory and a minimal set of abnormalities. The abductive method, on the other hand, treats explanations as sentences that, when added to the background theory, derive the observations. We show that there is a close connection between these two formalizations in the context of simple causal theories: domain theories in which a set of sentences are singled out as the explanatorily relevant causes of observations. There are two main results, which show that (with certain caveats) the consistency based approach can emulate abductive reasoning by adding closure axioms to a causal theory; and that abductive techniques can be used in place of the consistency based method in the domain of logic based diagnosis. It is especially interesting that in the latter case, the abductive techniques generate only relevant explanations, while diagnoses may have irrelevant elements.

AAAI Conference 1992 Conference Paper

Ideal Introspective Belief

  • Kurt Konolige

Autoepistemic (AE) logic is a formal system characterizing agents that have complete introspective access to their own beliefs. AE logic relies on a fixed point definition that has two significant parts. The first part is a set of assumptions or hypotheses about the contents of the fixed point. The second part is a set of reflection principles that link sentences with statements about their provability. We characterize a family of ideal AE reasoners in terms of the minimal hypotheses that they can make, and the weakest and strongest reflection principles that they can have, while still maintaining the interpretation of AE logic as self-belief. These results can help in analyzing metatheoretic systems in logic programming.

NMR Workshop 1989 Conference Paper

A Non-Monotonic Logic for Reasoning about Speech Acts and Belief Revision

  • Douglas E. Appelt
  • Kurt Konolige

Abstract A prerequisite to a theory of the way agents understand speech acts is a theory of how their beliefs and intentions are revised as a consequence of events. This process of attitude revision is an interesting domain for the application of nonmonotonic reasoning because speech acts have a conventional aspect that is readily represented by defaults, but that interacts with an agent's beliefs and intentions in many complex ways that may override the defaults. Perrault has developed a theory of speech acts, based on Rieter's default logic, that captures the conventional aspect; it does not, however, adequately account for certain easily observed facts about attitude revision resulting from speech acts. A natural theory of attitude revision seems to require a method of stating preferences among competing defaults. We present here a speech act theory, formalized in hierarchic autoepistemic logic (a refinement of Moore's autoepistemic logic), in which revision of both the speaker's and hearer's attitudes can be adequately described. As a collateral benefit, efficient automatic reasoning methods for the formalism exist. The theory has been implemented and is now being employed by an utterance-planning system.

IJCAI Conference 1989 Conference Paper

Ascribing Plans to Agents

  • Kurt Konolige
  • Martha E. Pollack

Intelligent agents who are situated in nuiltiagent domains must reason about one anotIters' actions and plans. Following the tradition of earlier work in A l, we present a model of plan recognition as belief and intention ascription, an inherently defeasible reasoning process. However, we encode this process using a direct argumentation system. Within this system, we can make explicit statements about why one candidate ascription should be preferred over another. And we can avoid the overly strong assumption that the actor's plan is correct from the perspective of the observer—an assumption that was necessary in previous formalizations of plan recognition.

AIJ Journal 1989 Journal Article

Eliminating the fixed predicates from a circumscription

  • Johan de Kleer
  • Kurt Konolige

Parallel predicate circumscription is the primary circumscriptive technique used in formalizing commonsense reasoning. In this paper we present a direct syntactic construction for transforming any parallel predicate circumscription using fixed predicates into an equivalent one which does not. Thus, we show that predicate circumscription is no more expressive with fixed predicates than without. We extend this result to prioritized circumscription. These results are expected to be useful for comparing circumscription to other nonmonotonic formalisms (such as autoepistemic logic and assumption-based truth maintenance) and for implementing fixed predicates.

NMR Workshop 1989 Conference Paper

Hierarchic Autoepistemic Theories for Non-Monotonic Reasoning: Preliminary Report

  • Kurt Konolige

Abstract Nonmonotonic logics are meant to be a formalization of nonmonotonic reasoning. However, for the most part they fail to embody two of the most important aspects of such reasoning: the explicit computational nature of nonmonotonic inference, and the assignment of preferences among competing inferences. We propose a method of nonmonotonic reasoning in which the notion of inference from specific bodies of evidence plays a fundamental role. The formalization is based on autoepistemic logic, but introduces additional structure, a hierarchy of evidential spaces. The method offers a natural formalization of many different applications of nonmonotonic reasoning, including reasoning about action, speech acts, belief revision, and various situations involving competing defaults.

AIJ Journal 1988 Journal Article

On the relation between default and autoepistemic logic

  • Kurt Konolige

Default logic is a formal means of reasoning about defaults: what normally is the case, in the absence of contradicting information. Autoepistemic logic, on the other hand, is meant to describe the consequences of reasoning about ignorance: what must be true if a certain fact is not known. Although the motivation and formal character of these two systems are different, a closer analysis shows that they share a common trait, which is the indexical nature of certain elements in the theory. In this paper we compare the expressive power of the two systems. First, we give an effective translation of default logic into autoepistemic logic; default theories can thus be embedded into autoepistemic logic. We also present a more surprising result: the reverse translation is also possible, so that every set of sentences in autoepistemic logic can be effectively rewritten as a default theory. The formal equivalence of these two differing systems is thus established. This analysis gives an interpretive semantics to default logic, and yields insight into the nature of defaults in autoepistemic reasoning.

TARK Conference 1986 Conference Paper

A Resolution Method for Quantified Modal Logics of Knowledge and Belief

  • Christophe Geissler
  • Kurt Konolige

B-resolution isa sound and complete resolutionrulefor quantifiedmodal logics of knowledge and beliefwith a standard Kripke semantics. Itdiffersfrom ordinary first-orderbinary resolutionin that itcan have an arbitrary (but finite)number of inputs, isnot necessarilyeffective, and does not have a most generalunifiercovering every instanceof an application. These propertiespresentobvious obstaclesto implementation in an automatic theorem-proving system. By using a techniquesimilar to semantic attachment, we obtain a very natural expression of B-resolution that is potentially efficient, and easily understood and controlled. We have implemented the method and used it to solve the Wise Man Puzzle.

TARK Conference 1986 Conference Paper

What Awareness Isn't: A Sentential View of Implicit and Explicit Belief

  • Kurt Konolige

In their attempt to model and reason about the beliefsof agents, artificial intelligence(AI) researchershave borrowed from two differentphilosophicaltraditions regarding the folkpsychology of belief. In one tradition, beliefis a relation between an agent and a proposition, that is, a propositional attitude. Formal analyses of propositional attitudes are often given in terms of a possible-worlds semantics. In the other tradition, beliefisa relationbetween an agent and a sentence that expresses a proposition (the sententialapproach). The arguments for and against these approaches are complicated, confusing, and often obscure and unintelligible(at least to this author). Nevertheless strong supporters exist for both sides, not only in the philosophicalarena (where one would expect it), but also in AI. In the latter field, some proponents of posslble-worlds analysis have attempted to remedy what appears to be its biggest drawback, namely the assumption that an agent believes all the logical consequences of his or her beliefs. Drawing on initial work by Levesque, Fagin and Halpern define a logic of 9eneral awareness that superimposes elements of the sentential approach on a possible-worlds framework. The result, they claim, is an appropriate model for resource-limited believers. We argue that this is a bad idea: it ends up being equivalent to a more complicated version of the sentential approach. In concluding we cannot refrain from adding to the debate about the utility of possible-worlds analyses of belief.

IJCAI Conference 1985 Conference Paper

User Modelling

  • D. Sleeman
  • Doug Appelt
  • Kurt Konolige
  • Elaine Rich
  • N. S. Sridharan
  • Bill Swartout

AAAI Conference 1982 Conference Paper

Circumscriptive Ignorance

  • Kurt Konolige

In formal systems that reason about knowledge, inferring that an agent actually does not know a particular fact can be problematic. Collins [1] has shown that there are many different modes of reasoning that a subject can use to show that he is ignorant of something; some of these, for example, involve the subject reasoning about the limitations of his own information-gathering and memory abilities. This paper will consider a single type of inference about ignorance, which we call circumscriptive ignorance. We present a partial formalization of circumscriptive ignorance and apply it to the Wise Man Puzzle.

AAAI Conference 1980 Conference Paper

Multiple-Agent Planning Systems

  • Kurt Konolige

MULTIPLE-AGENT PLANNING SYSTEMS Kurt Konolige Nils J. Nilsson SRI International, Menlo Park, California We analyze problems confronted by computer agents that synthesize plans that take into account (and employ) the plans of other, similar, cooperative agents. From the point of view of each of these agents, the others are dynamic entities that possess information about the world, have goals, make plans to achieve these goals, and execute these plans. Thus, each agent must represent not only the usual information about objects in the world and the preconditions and effects of its own actions, but it must also represent and reason about what other agents believe and what they may do. We describe a planning system t? ?at address es these is show how it solves a sample problem. sues and

v2026.09.13