Students in Appalachia have a heritage of problem-solving. We explore how computational thinking (CT) relates to and complements this heritage by analyzing 34 local ingenuity stories, and perspectives from 35 community members about the relevance of CT. We found the two problem-solving approaches are meaningfully different, but can be used in concert. Since equating them could contribute to confusion and cultural erasure, researchers and educators bringing CT as a problem solving strategy into rural and other resourceful cultures must clarify what they mean by “CT helps problem solving.” In these cultures, CT skills are better introduced as new tools to expand students’ problem-solving toolkits, rather than tools that are identical to or better than those traditionally used in their culture.
more »
« less
Fig Leaves, Pipe Dreams, and Myopia: Too-Easy Solutions in Environmental Law
Much of environmental law and policy rests on an unspoken premise that accomplishing environmental goals may not require addressing root causes of environmental problems. For example, rather than regulating risks directly, society may adopt warnings that merely avoid risk, and rather than limiting plastic use and reducing plastic waste, society may adopt recycling programs. Such approaches may be well-intended and may come at a relatively low economic or political cost. However, they often prove ineffective or even harmful, and they may mislead society into believing that further responses are unnecessary. This Article proposes the concept of “too-easy solutions” to describe these approaches. Too easy solutions can be classified into three subcategories: fig leaves—policy approaches that appear to do something about a problem without necessarily solving it; pipe dreams—policy approaches that are adopted with the good faith expectation of solving the problem but are inherently flawed; and myopic solutions—approaches that address part of the problem but may impede its overall resolution. Too-easy solutions analysis can serve as a powerful mechanism for evaluating policies and improving decisionmaking in the environmental arena and other areas as well.
more »
« less
- Award ID(s):
- 2147334
- PAR ID:
- 10397726
- Date Published:
- Journal Name:
- University of Colorado law review
- ISSN:
- 0041-9516
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Weak sustainability, WS, attempts a comprehensive notion of sustainability, sustaining human welfare directly, or equivalently, sustaining inclusive wealth, IW, sufficient to sustain welfare. Sustainability is, in principle, forever, and accordingly, IW is conceived and assessed in a very long-term context. Given that future outcomes are unobservable, IW assessments are conducted in terms of expectations. However, this introduces pervasive circular reasoning: the calculated value of IW assumes that our expectations will be met, but that is the question. Optimistic expectations (for example) increase calculated IW, which, in turn, increases our confidence that our society is on a sustainable path. Given the logical difficulties of projecting IW into the future, analysts resort to tracking IW at regular intervals through the recent past. This reduces, but does not eliminate, the circularity problem. The signals from tracking IW are less than perfect from a policy perspective: they are too aggregate, perhaps masking impending crises regarding particular resources until it is too late; and too dependent on imperfect markets; and they document the recent past, so policy managers are always playing catch-up. WS-based sustainability policy frameworks include WS-plus, which invokes ad hoc strong sustainability, SS, patches to address threatened resource crises. It may also be possible to allow a degree of WS flexibility for individual jurisdictions within the constraints of a global safe operating space, SOS.more » « less
-
In large scale coverage operations, such as marine exploration or aerial monitoring, single robot approaches are not ideal, as they may take too long to cover a large area. In such scenarios, multi-robot approaches are preferable. Furthermore, several real world vehicles are non-holonomic, but can be modeled using Dubins vehicle kinematics. This paper focuses on environmental monitoring of aquatic environments using Autonomous Surface Vehicles (ASVs). In particular, we propose a novel approach for solving the problem of complete coverage of a known environment by a multi-robot team consisting of Dubins vehicles. It is worth noting that both multi-robot coverage and Dubins vehicle coverage are NP-complete problems. As such, we present two heuristics methods based on a variant of the traveling salesman problem-k-TSP-formulation and clustering algorithms that efficiently solve the problem. The proposed methods are tested both in simulations to assess their scalability and with a team of ASVs operating on a 200 km 2 lake to ensure their applicability in real world.more » « less
-
Research suggests expert designers frame problems more broadly than novices, but authentic context may make a design problem too difficult. Yet decontextualized problems provide little opportunity for students to learn how to direct their framing and solving of problems. This paper considers characteristics of design problems that support students to develop design skills as they learn and apply concepts to the framing and solving of design problems. We selected and analyzed (un)successful design problems used over four years of iterations in an undergraduate chemical engineering program. We analyze salient features that made the design problems particularly educative and generalize an Educative Design Problem Framework, finding that such problems are relevant to students, have sociotechnical complexity, and are accessible yet require accurate application of technical content to solutions that are not deterministic—in other words, they are low-bar entry and high ceiling. Faculty can use this framework to evaluate and improve design problems in their teaching.more » « less
-
Model predictive control (MPC) provides a useful means for controlling systems with constraints, but suffers from the computational burden of repeatedly solving an optimization problem in real time. Offline (explicit) solutions for MPC attempt to alleviate real time computational challenges using either multiparametric programming or machine learning. The multiparametric approaches are typically applied to linear or quadratic MPC problems, while learning-based approaches can be more flexible and are less memory-intensive. Existing learning-based approaches offer significant speedups, but the challenge becomes ensuring constraint satisfaction while maintaining good performance. In this paper, we provide a neural network parameterization of MPC policies that explicitly encodes the constraints of the problem. By exploring the interior of the MPC feasible set in an unsupervised learning paradigm, the neural network finds better policies faster than projection-based methods and exhibits substantially shorter solve times. We use the proposed policy to solve a robust MPC problem, and demonstrate the performance and computational gains on a standard test system.more » « less
An official website of the United States government

